2109 search results - page 230 / 422 » Solving Necklace Constraint Problems |
147
Voted
AAAI
1990
15 years 7 months ago
1990
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...
157
Voted
ICRA
2008
IEEE
16 years 17 days ago
2008
IEEE
— This paper focuses on the assignment of discrete points to two robots, in the presence of geometric and kinematic constraints between the robots. The individual points have dif...
165
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
The transportation planning (TP) is well-known basic network problem. However, for some real-world applications, it is often that the TP model is extended to satisfy other additio...
145
click to vote
AAAI
2006
15 years 7 months ago
2006
Model counting is the classical problem of computing the number of solutions of a given propositional formula. It vastly generalizes the NP-complete problem of propositional satis...
163
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...