Sciweavers

1220 search results - page 81 / 244
» Minimal Interval Completions
Sort
View
WRLA
2010
13 years 7 months ago
Folding Variant Narrowing and Optimal Variant Termination
Abstract. If a set of equations E∪Ax is such that E is confluent, terminating, and coherent modulo Ax, narrowing with E modulo Ax provides a complete E∪Ax-unification algorit...
Santiago Escobar, Ralf Sasse, José Meseguer
CP
2005
Springer
14 years 2 months ago
Allocation and Scheduling for MPSoCs via Decomposition and No-Good Generation
This paper describes an efficient, complete approach for solving a complex allocation and scheduling problem for Multi-Processor System-on-Chip (MPSoC). Given a throughput constra...
Luca Benini, Davide Bertozzi, Alessio Guerri, Mich...
DATE
2005
IEEE
176views Hardware» more  DATE 2005»
13 years 11 months ago
LORD: A Localized, Reactive and Distributed Protocol for Node Scheduling in Wireless Sensor Networks
The lifetime of wireless sensor networks can be increased by minimizing the number of active nodes that provide complete coverage, while switching off the rest. In this paper, we ...
Arijit Ghosh, Tony Givargis
GLVLSI
2005
IEEE
122views VLSI» more  GLVLSI 2005»
14 years 2 months ago
PIM lite: a multithreaded processor-in-memory prototype
Abstract— PIM Lite is a processor-in-memory prototype implemented in a 0.18 micron logic process. PIM Lite provides a complete working demonstration of a minimal-state, lightweig...
Shyamkumar Thoziyoor, Jay B. Brockman, Daniel Rinz...
EOR
2008
85views more  EOR 2008»
13 years 9 months ago
The Linear Ordering Problem with cumulative costs
Several optimization problems require finding a permutation of a given set of items that minimizes a certain cost function. These problems are naturally modelled in graph-theory t...
Livio Bertacco, Lorenzo Brunetta, Matteo Fischetti