By Topic

XXV International Conference of the Chilean Computer Science Society (SCCC'05)

Date 7-11 Nov. 2005

Filter Results

Displaying Results 1 - 23 of 23
  • XXV International Conference of the Chilean Computer Science Society - Front Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (730 KB)
    Freely Available from IEEE
  • Proceedings. 25th International Conference of the Chilean Computer Science Society

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (32 KB)
    Freely Available from IEEE
  • XXV International Conference of the Chilean Computer Science Society - Copyright

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (44 KB)
    Freely Available from IEEE
  • XXV International Conference of the Chilean Computer Science Society - Table of contents

    Publication Year: 2005, Page(s):v - vi
    Request permission for commercial reuse | PDF file iconPDF (34 KB)
    Freely Available from IEEE
  • Foreword

    Publication Year: 2005, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (25 KB) | HTML iconHTML
    Freely Available from IEEE
  • Program Committee

    Publication Year: 2005, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (22 KB)
    Freely Available from IEEE
  • Additional reviewers

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Chairs

    Publication Year: 2005, Page(s): ix
    Request permission for commercial reuse | PDF file iconPDF (20 KB)
    Freely Available from IEEE
  • Optimizing repair programs for consistent query answering

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    Databases may not satisfy integrity constraints (ICs) for several reasons. Nevertheless, in most of the cases an important part of the data is still consistent wrt certain desired ICs, and the database can still give some correct answers to queries wrt those ICs. Consistent query answers are characterized as ordinary answers obtained from every minimally repaired and consistent version of the data... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A geometric framework to visualize fuzzy-clustered data

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (472 KB) | HTML iconHTML

    Fuzzy clustering methods have been widely used in many applications. These methods, including fuzzy k-means and expectation maximization, allow an object to be assigned to multi-clusters with different degrees of membership. However, the memberships that result from fuzzy clustering algorithms are difficult to analyze and visualize, and usually are converted to 0-1 memberships. In this paper, we p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Algorithm explanation using multimodal interfaces

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (608 KB) | HTML iconHTML

    Software visualization and algorithm animation have been tackled almost exclusively from the visual point of view, this means representation and control occur through the visual channel. This approach has its limitations. To achieve better comprehension, we deal with multimodal interfaces that include other means of interaction together with those of the standard systems for data visualization and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A stochastic non-deterministic temporal concurrent constraint calculus

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    We propose sntcc, a stochastic extension of the ntcc calculus, a model of temporal concurrent constraint programming with the capability of modeling asynchronous and non-deterministic timed behavior. We argue that such an extension is needed to faithfully model concurrent systems in real-life situations. We provide a suitable temporal logic and proof system for sntcc and illustrate how to use them... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Propagating updates in real-time search: FALCONS(k)

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    We enhance real-time search algorithms with bounded propagation of heuristic changes. When the heuristic of the current state is updated, this change is propagated consistently up to k states not necessarily distinct. Applying this idea to FALCONS, we have develop the new FALCONS(k), an algorithm that keeps the good theoretical properties of FALCONS and improves its performance. We provide experim... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A simulated annealing approach to find the optimal parameters for fuzzy clustering microarray data

    Publication Year: 2005
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (896 KB) | HTML iconHTML

    Rapid advances of microarray technologies are making it possible to analyze and manipulate large amounts of gene expression data. Clustering algorithms, such as hierarchical clustering, self-organizing maps, k-means and fuzzy k-means, have become important tools for expression analysis of microarray data. However, the need of prior knowledge of the number of clusters, k, and the fuzziness paramete... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Modeling expert players' behavior through data mining

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (280 KB) | HTML iconHTML

    Games are a field in which players are implicitly trained and compelled to solve hard problems optimally. By making an appropriate training experiment using a computer game, players can reach expert performance. A computer game tournament that contains Euclidian traveling salesman problem (ETSP) instances is developed and solutions made by expert players are analyzed with human-behavior hypotheses... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Design pattern for the adaptive scheduling of real-time tasks with multiple versions in RTSJ

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (352 KB) | HTML iconHTML

    This paper presents a design pattern of an adaptive scheduling based on the management of the tasks execution time, achieved through multiple versions of the tasks, applied to the real-time specification for Java. A structure of classes is used to facilitate the development of tasks, while allowing the independence of the application code from the code responsible for the adaptive control. The des... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel evolution strategy for protein threading

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (368 KB) | HTML iconHTML

    The protein threading problem is the problem of determining the three-dimensional structure of a given but arbitrary protein sequence from a set of known structures of other proteins. This problem is known to be NP-hard and current computational approaches to threading are time-consuming and data-intensive. In this paper, we propose an evolution strategy for protein threading. We also developed tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • EXEHDA middleware: aspects to manage the ISAM pervasive environment

    Publication Year: 2005
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (736 KB) | HTML iconHTML

    In this paper we present an overview of EXEHDA, an adaptive, services-oriented middleware, conceived to support the execution of pervasive applications and the management of a pervasive environment. EXEHDA is being developed in the context of the ISAM project, which aims to provide an integrated solution, from development to execution, for general-purpose pervasive computing applications. The ISAM... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Obtaining possible execution histories on multiple memory consistency models

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (264 KB) | HTML iconHTML

    In order to make shared memory programming possible in distributed architectures, we use an abstraction called distributed shared memory. The behavior of distributed shared memory systems is dictated by the memory consistency model. In order to provide a better understanding on the semantics of the memory consistency models, many researchers have proposed formalisms to define them. Even with forma... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Using active messages to explore high performance in clusters of computers

    Publication Year: 2005
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (296 KB) | HTML iconHTML

    This paper presents the development of a mechanism to support communication in clusters of computers, focused in exploring this hardware for high performance processing. The mechanism is based on the active messages model and was developed to be introduced as communication support to a high performance programming environment. Its implementation is performed in the application level, using multith... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing active objects on a peer to peer infrastructure

    Publication Year: 2005
    Cited by:  Papers (1)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (232 KB) | HTML iconHTML

    We present a contribution on dynamic load balancing for distributed and parallel object-oriented applications. We specially target on peer to peer systems and its capability to distribute parallel computation, which transfer large amount of data (called intensive-communicated applications) among large number of processors. We explain the relation between active objects and processors load. Using t... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel strategies for a multi-criteria GRASP algorithm

    Publication Year: 2005
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (248 KB) | HTML iconHTML

    This paper proposes different strategies of parallelizing a multi-criteria GRASP (greedy randomized adaptive search problem) algorithm. The parallel GRASP algorithm is applied to the multi-criteria minimum spanning tree problem, which is NP-hard. In this problem, a vector of costs is defined for each edge of the graph and the goal is to find all the efficient or Pareto optimal spanning trees (solu... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2005, Page(s): 123
    Request permission for commercial reuse | PDF file iconPDF (23 KB)
    Freely Available from IEEE