2107 search results - page 150 / 422 » Computing Small Search Numbers in Linear Time |
124
Voted
AUTOMATICA
2008
15 years 3 months ago
2008
The problem of computing bounds on the region-of-attraction for systems with polynomial vector fields is considered. Invariant subsets of the region-of-attraction are characterize...
139
Voted
STACS
2009
Springer
15 years 8 months ago
2009
Springer
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
148
Voted
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— One primary goal in rescue robotics is to deploy a team of robots for coordinated victim search after a disaster. This requires robots to perform subtasks, such as victim detec...
130
Voted
IMECS
2007
15 years 5 months ago
2007
—This paper presents a new metamodel-assisted metaheuristic algorithm for optimisation problems involving computationally expensive simulations. The algorithm, called Global Prob...
130
Voted
CORR
2006
Springer
15 years 3 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...