Sciweavers

40212 search results - page 8025 / 8043
» More
Sort
View
STACS
2010
Springer
14 years 3 months ago
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs
In 2000 Alber et al. [SWAT 2000 ] obtained the ļ¬rst 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, ...
ICS
2009
Tsinghua U.
14 years 3 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 ...
ICRA
2009
IEEE
176views Robotics» more  ICRA 2009»
14 years 3 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...
ACISP
2009
Springer
14 years 3 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...
ATAL
2009
Springer
14 years 3 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 »