Sciweavers

6274 search results - page 1224 / 1255
» From query complexity to computational complexity
Sort
View
155
Voted
ICRA
2002
IEEE
136views Robotics» more  ICRA 2002»
15 years 8 months ago
Motion Dynamics of a Rover with Slip-Based Traction Model
This paper investigates kinetic behavior of a planetary rover with attention to tire-soil traction mechanics and articulated body dynamics, and thereby study the control when the ...
Kazuya Yoshida, Hiroshida Hamano
130
Voted
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 8 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
134
Voted
LICS
2000
IEEE
15 years 8 months ago
Concurrent Omega-Regular Games
We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose ...
Luca de Alfaro, Thomas A. Henzinger
120
Voted
ISAAC
1998
Springer
99views Algorithms» more  ISAAC 1998»
15 years 8 months ago
On the Multiple Gene Duplication Problem
Abstract. A fundamental problem in computational biology is the determination of the correct species tree for a set of taxa given a set of possibly contradictory gene trees. In rec...
Michael R. Fellows, Michael T. Hallett, Ulrike Ste...
174
Voted
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 7 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
« Prev « First page 1224 / 1255 Last » Next »