1964 search results - page 302 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
110
Voted
AAAI
2006
15 years 4 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
129
Voted
WSCG
2004
15 years 4 months ago
2004
One of the most important problems to solve in Solid Modeling is computing boolean operations for solids (union, intersection and difference). In this paper we present a method to...
127
Voted
CORR
2008
Springer
15 years 2 months ago
2008
Springer
The canonical problem of solving a system of linear equations arises in numerous contexts in information theory, communication theory, and related fields. In this contribution, we ...
ENTCS
2007
15 years 2 months ago
2007
Application of model checking to isolated software components is not directly possible because a component does not form a complete program - the problem of missing environment oc...
170
Voted
ROBOCOMM
2007
IEEE
15 years 9 months ago
2007
IEEE
—Path planning for mobile robots is a well researched problem for over three decades. In this paper, we test and evaluate a new approach based on Shi and Karl Level Sets for mobi...