Sciweavers

379 search results - page 46 / 76
» Strong reducibility of partial numberings
Sort
View
AI
2008
Springer
13 years 9 months ago
Domain filtering consistencies for non-binary constraints
In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency...
Christian Bessiere, Kostas Stergiou, Toby Walsh
EOR
2008
97views more  EOR 2008»
13 years 9 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
IJWET
2008
108views more  IJWET 2008»
13 years 9 months ago
Web service workflow selection using system and network QoS constraints
: Web services serve as a leading technology platform for web-based data-centric environments providing flexibility of loose coupling, message-based communication. Interest in more...
Yannis Panagis, Konstantinos Papakonstantinou, Eva...
GC
2007
Springer
13 years 9 months ago
Precoloring Extension of Co-Meyniel Graphs
The pre-coloring extension problem consists, given a graph G and a set of nodes to which some colors are already assigned, in finding a coloring of G with the minimum number of co...
Vincent Jost, Benjamin Lévêque, Fr&ea...
BIOINFORMATICS
2005
109views more  BIOINFORMATICS 2005»
13 years 9 months ago
Prediction error estimation: a comparison of resampling methods
In genomic studies, thousands of features are collected on relatively few samples. One of the goals of these studies is to build classifiers to predict the outcome of future obser...
Annette M. Molinaro, Richard Simon, Ruth M. Pfeiff...