Sciweavers

40212 search results - page 8025 / 8043
» More
Sort
View
136
Voted
STACS
2010
Springer
15 years 10 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the first parameterized subexponential algorithm on undirected planar graphs by showing that k-DOMINATING SET is solvable in time 2O( ā...
Frederic Dorn, Fedor V. Fomin, Daniel Lokshtanov, ...
154
Voted
ICS
2009
Tsinghua U.
15 years 10 months ago
Less reused filter: improving l2 cache performance via filtering less reused lines
The L2 cache is commonly managed using LRU policy. For workloads that have a working set larger than L2 cache, LRU behaves poorly, resulting in a great number of less reused lines...
Lingxiang Xiang, Tianzhou Chen, Qingsong Shi, Wei ...
133
Voted
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
15 years 10 months ago
Rollin' Justin - Mobile platform with variable base
Abstract— Research on humanoid robots for use in servicing tasks, e.g. fetching and delivery, attracts steadily more interest. With ā€Rollin’ Justinā€ a mobile robotic system...
Christoph Borst, Thomas Wimböck, Florian Schm...
135
Voted
ACISP
2009
Springer
15 years 10 months ago
Inside the Hypercube
Bernstein’s CubeHash is a hash function family that includes four functions submitted to the NIST Hash Competition. A CubeHash function is parametrized by a number of rounds r, a...
Jean-Philippe Aumasson, Eric Brier, Willi Meier, M...
141
Voted
ATAL
2009
Springer
15 years 10 months ago
Caching schemes for DCOP search algorithms
Distributed Constraint Optimization (DCOP) is useful for solving agent-coordination problems. Any-space DCOP search algorithms require only a small amount of memory but can be spe...
William Yeoh, Pradeep Varakantham, Sven Koenig
« Prev « First page 8025 / 8043 Last » Next »