Sciweavers

208 search results - page 3 / 42
» A Constraint on the Number of Distinct Vectors with Applicat...
Sort
View
LICS
2010
IEEE
13 years 3 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...
CP
1998
Springer
13 years 9 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
BIBE
2008
IEEE
150views Bioinformatics» more  BIBE 2008»
13 years 5 months ago
Automatic DNA microarray gridding based on Support Vector Machines
This paper presents a novel method for DNA microarray gridding based on Support Vector Machine (SVM) classifiers. It employs a set of soft-margin SVMs to estimate the lines of the ...
Dimitris G. Bariamis, Dimitris Maroulis, Dimitrios...
CP
2006
Springer
13 years 9 months ago
Distributed Constraint-Based Local Search
Distributed computing is increasingly important at a time when the doubling of the number of transistors on a processor every 18 months no longer translates in a doubling of speed ...
Laurent Michel, Andrew See, Pascal Van Hentenryck
OTM
2005
Springer
13 years 10 months ago
Empirical Evaluation of Dynamic Local Adaptation for Distributed Mobile Applications
Distributed mobile applications operate on devices with diverse capabilities, in heterogeneous environments, where parameters such as processor, memory and network utilisation, are...
Pablo Rossi, Caspar Ryan