Sciweavers

614 search results - page 31 / 123
» Local Computation: Lower and Upper Bounds
Sort
View
FSTTCS
2010
Springer
13 years 5 months ago
On extracting computations from propositional proofs (a survey)
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
Pavel Pudlák
SOCO
2010
Springer
13 years 2 months ago
Taximeter verification with GPS and soft computing techniques
Until recently, local governments in Spain were using machines with rolling cylinders for verifying taximeters. However, the condition of the tires can lead to errors in the proces...
José Villar, Adolfo Otero, José Oter...
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
14 years 1 months ago
Simulation-aided reachability and local gain analysis for nonlinear dynamical systems
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
EOR
2007
82views more  EOR 2007»
13 years 7 months ago
The equitable location problem on the plane
This paper considers the problem of locating M facilities on the unit square so as to minimize the maximal demand faced by each facility subject to closest assignments and coverag...
Opher Baron, Oded Berman, Dmitry Krass, Qian Wang
ICLP
2009
Springer
14 years 8 months ago
Using Histograms to Better Answer Queries to Probabilistic Logic Programs
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
Matthias Broecheler, Gerardo I. Simari, V. S. Subr...