Sciweavers

1199 search results - page 214 / 240
» Parameterized Proof Complexity
Sort
View
JCSS
2000
116views more  JCSS 2000»
13 years 7 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
TOPLAS
1998
133views more  TOPLAS 1998»
13 years 7 months ago
A Systematic Study of Functional Language Implementations
Abstract: We introduce a unified framework to describe, relate, compare and classify functional language implementations. The compilation process is expressed as a succession of p...
Rémi Douence, Pascal Fradet
PVLDB
2008
107views more  PVLDB 2008»
13 years 7 months ago
XTreeNet: democratic community search
We describe XTreeNet, a distributed query dissemination engine which facilitates democratization of publishing and efficient data search among members of online communities with p...
Emiran Curtmola, Alin Deutsch, Dionysios Logotheti...
ICRA
2010
IEEE
150views Robotics» more  ICRA 2010»
13 years 6 months ago
Balancing state-space coverage in planning with dynamics
— Sampling-based kinodynamic planners, such as the popular RRT algorithm, have been proposed as promising solutions to planning for systems with dynamics. Nevertheless, complex s...
Yanbo Li, Kostas E. Bekris
RAS
2010
164views more  RAS 2010»
13 years 6 months ago
Towards performing everyday manipulation activities
This article investigates fundamental issues in scaling autonomous personal robots towards open-ended sets of everyday manipulation tasks which involve high complexity and vague j...
Michael Beetz, Dominik Jain, Lorenz Mösenlech...