6456 search results - page 338 / 1292 » Constraint Solving on Terms |
300
Voted
CP
2009
Springer
16 years 7 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
196
click to vote
CADE
2002
Springer
16 years 7 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
164
Voted
TACAS
2009
Springer
16 years 1 months ago
2009
Springer
We discuss the problem of path feasibility for programs manipulating strings using a collection of standard string library functions. We prove results on the complexity of this pro...
165
click to vote
ICRA
2008
IEEE
16 years 1 months 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...
167
click to vote
GD
2005
Springer
16 years 7 days ago
2005
Springer
Most graph layout algorithms treat nodes as points. The problem of node overlap removal is to adjust the layout generated by such methods so that nodes of non-zero width and height...