127 search results - page 19 / 26 » Measuring the Hardness of SAT Instances |
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Encouraging voters to truthfully reveal their preferences in an election has long been an important issue. Previous studies have shown that some voting protocols are hard to manip...
AI
2000
Springer
13 years 7 months ago
2000
Springer
GENET is a heuristic repair algorithm which demonstrates impressive e ciency in solving some large-scale and hard instances of constraint satisfaction problems (CSPs). In this pap...
IEAAIE
2010
Springer
13 years 5 months ago
2010
Springer
This paper introduces a new tabu search algorithm for a strip packing problem. It integrates several key features: A consistent neighborhood, a fitness function including problem k...
TASE
2010
IEEE
13 years 2 months ago
2010
IEEE
Robots operating in a workspace can localize themselves by querying nodes of a sensor-network deployed in the same workspace. This paper addresses the problem of computing the min...
KDD
2009
ACM
14 years 8 months ago
2009
ACM
Active and semi-supervised learning are important techniques when labeled data are scarce. Recently a method was suggested for combining active learning with a semi-supervised lea...