Sciweavers

2542 search results - page 34 / 509
» Computing Cartograms with Optimal Complexity
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
ICRA
2010
IEEE
117views Robotics» more  ICRA 2010»
13 years 6 months ago
Data-driven optimization for underactuated robotic hands
— Passively adaptive and underactuated robotic hands have shown the potential to achieve reliable grasping in unstructured environments without expensive mechanisms or sensors. I...
Matei T. Ciocarlie, Peter K. Allen
ICAART
2010
INSTICC
14 years 4 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
DSD
2002
IEEE
86views Hardware» more  DSD 2002»
14 years 19 days ago
Using Formal Tools to Study Complex Circuits Behaviour
We use a formal tool to extract Finite State Machines (FSM) based representations (lists of states and transitions) of sequential circuits described by flip-flops and gates. The...
Paul Amblard, Fabienne Lagnier, Michel Lévy
CISS
2008
IEEE
14 years 2 months ago
Distributed computation of a sparse cover in sensor networks without location information
— In this paper, we present a distributed algorithm for detecting redundancies in a sensor network with no location information. We demonstrate how, in the absence of localizatio...
Alireza Tahbaz-Salehi, Ali Jadbabaie