Sciweavers

160 search results - page 31 / 32
» Approximability of Manipulating Elections
Sort
View
FLAIRS
2004
13 years 6 months ago
CSAA: A Distributed Ant Algorithm Framework for Constraint Satisfaction
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
Koenraad Mertens, Tom Holvoet
VMV
2004
185views Visualization» more  VMV 2004»
13 years 6 months ago
Convexification of Unstructured Grids
Unstructured tetrahedral grids are a common data representation of three-dimensional scalar fields. For convex unstructured meshes efficient rendering methods are known. For conca...
Stefan Röttger, Stefan Guthe, Andreas Schiebe...
BMCBI
2006
116views more  BMCBI 2006»
13 years 5 months ago
MICA: desktop software for comprehensive searching of DNA databases
Background: Molecular biologists work with DNA databases that often include entire genomes. A common requirement is to search a DNA database to find exact matches for a nondegener...
William A. Stokes, Benjamin S. Glick
DATAMINE
2006
176views more  DATAMINE 2006»
13 years 5 months ago
A Bit Level Representation for Time Series Data Mining with Shape Based Similarity
Clipping is the process of transforming a real valued series into a sequence of bits representing whether each data is above or below the average. In this paper, we argue that clip...
Anthony J. Bagnall, Chotirat (Ann) Ratanamahatana,...
ENTCS
2007
116views more  ENTCS 2007»
13 years 5 months ago
Experiments in Cost Analysis of Java Bytecode
Recently, we proposed a general framework for the cost analysis of Java bytecode which can be used for measuring resource usage. This analysis generates, at compile-time, cost rel...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...