Sciweavers

452 search results - page 43 / 91
» Finding bugs is easy
Sort
View
ESA
1994
Springer
139views Algorithms» more  ESA 1994»
14 years 3 days ago
A Simple Min Cut Algorithm
We present an algorithm for finding the minimum cut of an undirected edge-weighted graph. It is simple in every respect. It has a short and compact description, is easy to implemen...
Mechthild Stoer, Frank Wagner
CEC
2009
IEEE
14 years 12 hour ago
Reverse-engineering of artificially evolved controllers for swarms of robots
It is generally challenging to design decentralized controllers for swarms of robots because there is often no obvious relation between the individual robot behaviors and the final...
Sabine Hauert, Jean-Christophe Zufferey, Dario Flo...
CLEF
2006
Springer
13 years 11 months ago
XML Information Retrieval from Spoken Word Archives
In this paper the XML Information Retrieval System PF/Tijah is applied to retrieval tasks on large spoken document collections. The used example setting is the English CLEF-2006 CL...
Robin Aly, Djoerd Hiemstra, Roeland Ordelman, Laur...
FPL
2004
Springer
115views Hardware» more  FPL 2004»
13 years 11 months ago
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices
We describe algorithmic results for two crucial aspects of allocating resources on computational hardware devices with partial reconfigurability. By using methods from the field of...
Ali Ahmadinia, Christophe Bobda, Sándor P. ...
DAMON
2006
Springer
13 years 11 months ago
Realizing parallelism in database operations: insights from a massively multithreaded architecture
A new trend in processor design is increased on-chip support for multithreading in the form of both chip multiprocessors and simultaneous multithreading. Recent research in databa...
John Cieslewicz, Jonathan W. Berry, Bruce Hendrick...