874 search results - page 151 / 175 » Faster Algorithms for Semi-Matching Problems |
133
click to vote
TACAS
2010
Springer
15 years 11 months ago
2010
Springer
Boolean satisfiability (SAT) and its extensions are becoming a core technology for the analysis of systems. The SAT-based approach divides into three steps: encoding, preprocessin...
146
click to vote
ICDE
2009
IEEE
15 years 11 months ago
2009
IEEE
— Given a large graph and a set of objects, the task of object connection discovery is to find a subgraph that retains the best connection between the objects. Object connection...
131
click to vote
ICRA
2008
IEEE
15 years 11 months ago
2008
IEEE
— Target tracking has two variants that are often studied independently with different approaches: target searching requires a robot to find a target initially not visible, and ...
142
click to vote
ISAAC
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case efficient ...
ICTAI
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper shows a way to speed up search by using an encoding at bit level to model a particular domain. A bitboard is an unsigned integer whose bits have been given an interpret...