Sciweavers

3360 search results - page 313 / 672
» Opportunistic Data Structures with Applications
Sort
View
CORR
2004
Springer
125views Education» more  CORR 2004»
15 years 4 months ago
High-Level Networking With Mobile Code And First Order AND-Continuations
We describe a scheme for moving living code between a set of distributed processes coordinated with unification based Linda operations, and its application to building a comprehen...
Paul Tarau, Verónica Dahl
ICRA
2010
IEEE
126views Robotics» more  ICRA 2010»
15 years 3 months ago
Planning short paths with clearance using explicit corridors
— A central problem of applications dealing with virtual environments is planning a collision-free path for a character. Since environments and their characters are growing more ...
Roland Geraerts
EVOW
2011
Springer
14 years 8 months ago
Two Iterative Metaheuristic Approaches to Dynamic Memory Allocation for Embedded Systems
Abstract. Electronic embedded systems designers aim at finding a tradeoff between cost and power consumption. As cache memory management has been shown to have a significant imp...
María Soto, André Rossi, Marc Sevaux
115
Voted
WEBDB
2009
Springer
104views Database» more  WEBDB 2009»
15 years 11 months ago
Entity Search with NECESSITY
Loosely structured heterogeneous information spaces are typically created by merging data from a variety of different applications and information sources. A common problem these...
Ekaterini Ioannou, Saket Sathe, Nicolas Bonvin, An...
ICPR
2008
IEEE
15 years 11 months ago
An approximate algorithm for median graph computation using graph embedding
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
Miquel Ferrer, Ernest Valveny, Francesc Serratosa,...