Sciweavers

397 search results - page 29 / 80
» Towards Polynomial Lower Bounds for Dynamic Problems
Sort
View
GOSLER
1995
13 years 11 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
RAS
2007
109views more  RAS 2007»
13 years 7 months ago
On point-to-point motion planning for underactuated space manipulator systems
In free-floating mode, space manipulator systems have their actuators turned off, and exhibit nonholonomic behavior due to angular momentum conservation. The system is underactua...
Ioannis Tortopidis, Evangelos Papadopoulos
INFOCOM
2000
IEEE
14 years 7 hour ago
Broadcast Disks with Polynomial Cost Functions
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...
Amotz Bar-Noy, Boaz Patt-Shamir, Igor Ziper
CORR
2010
Springer
185views Education» more  CORR 2010»
13 years 7 months ago
A new exponential separation between quantum and classical one-way communication complexity
We present a new example of a partial boolean function whose one-way quantum communication complexity is exponentially lower than its one-way classical communication complexity. T...
Ashley Montanaro
FSTTCS
2006
Springer
13 years 11 months ago
Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
Given a graph G=(V, E) on n vertices, the MAXIMUM r-REGULAR INDUCED SUBGRAPH (M-r-RIS) problems ask for a maximum sized subset of vertices R V such that the induced subgraph on R,...
Sushmita Gupta, Venkatesh Raman, Saket Saurabh