Sciweavers

97 search results - page 4 / 20
» Near-Optimal Search in Continuous Domains
Sort
View
ICRA
2006
IEEE
225views Robotics» more  ICRA 2006»
14 years 3 months ago
Constraint Optimization Coordination Architecture for Search and Rescue Robotics
— The dangerous and time sensitive nature of a disaster area makes it an ideal application for robotic exploration. Our long term goal is to enable humans, software agents, and a...
Mary Koes, Illah R. Nourbakhsh, Katia P. Sycara
STOC
2001
ACM
134views Algorithms» more  STOC 2001»
14 years 10 months ago
Data-streams and histograms
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...
Sudipto Guha, Nick Koudas, Kyuseok Shim
OL
2007
121views more  OL 2007»
13 years 9 months ago
Global optimization by continuous grasp
We introduce a novel global optimization method called Continuous GRASP (C-GRASP) which extends Feo and Resende’s greedy randomized adaptive search procedure (GRASP) from the dom...
Michael J. Hirsch, Cláudio Nogueira de Mene...
IJCAI
1989
13 years 10 months ago
Constraint Satisfiability Algorithms for Interactive Student Scheduling
A constraint satisfiability problem consists of a set of variables, their associated domains (i.e., the set of values the variable can take) and a set of constraints on these vari...
Ronen Feldman, Martin Charles Golumbic
FORMATS
2010
Springer
13 years 7 months ago
Natural Domain SMT: A Preliminary Assessment
SMT solvers have traditionally been based on the DPLL(T) algorithm, where the driving force behind the procedure is a DPLL search over truth valuations. This traditional framework ...
Scott Cotton