3820 search results - page 98 / 764 » Bounded Model Debugging |
177
click to vote
CC
2010
Springer
15 years 21 days ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
111
click to vote
COCO
2001
Springer
15 years 6 months ago
2001
Springer
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard...
ICRA
1994
IEEE
15 years 6 months ago
1994
IEEE
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 ...
131
click to vote
COLT
2003
Springer
15 years 7 months ago
2003
Springer
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...
ICCAD
2007
IEEE
15 years 11 months ago
2007
IEEE
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...