Sciweavers

3991 search results - page 116 / 799
» Bounding homogeneous models
Sort
View
ICRA
1994
IEEE
98views Robotics» more  ICRA 1994»
14 years 4 days ago
Efficient Distance Computation Between Non-Convex Objects
This paper describes an efficient algorithm for computing the distance between non-convex objects. Objects are modeled as the union of a set of convex components. From this model ...
Sean Quinlan
COLT
2003
Springer
14 years 1 months ago
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem
We consider the Multi-armed bandit problem under the PAC (“probably approximately correct”) model. It was shown by Even-Dar et al. [5] that given n arms, it suffices to play th...
Shie Mannor, John N. Tsitsiklis
ICCAD
2007
IEEE
173views Hardware» more  ICCAD 2007»
14 years 5 months ago
Bounding L2 gain system error generated by approximations of the nonlinear vector field
Abstract— Typical nonlinear model order reduction approaches need to address two issues: reducing the order of the model, and approximating the vector field. In this paper we fo...
Kin Cheong Sou, Alexandre Megretski, Luca Daniel
CPAIOR
2006
Springer
13 years 11 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
IJCAI
2003
13 years 9 months ago
A Fast and Simple Algorithm for Bounds Consistency of the AllDifferent Constraint
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
Alejandro López-Ortiz, Claude-Guy Quimper, ...