1101 search results - page 218 / 221 » An Algorithm for the Graph Crossing Number Problem |
111
click to vote
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
150
Voted
MOBICOM
2010
ACM
15 years 2 months ago
2010
ACM
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
130
click to vote
BMCBI
2005
15 years 2 months ago
2005
Background: Accurate and automatic gene finding and structural prediction is a common problem in bioinformatics, and applications need to be capable of handling non-canonical spli...
156
click to vote
SIAMIS
2010
14 years 9 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
132
click to vote
FCT
2009
Springer
15 years 9 months ago
2009
Springer
Suppose that we are given a set of n elements d of which are “defective”. A group test can check for any subset, called a pool, whether it contains a defective. It is well know...