Sciweavers

7820 search results - page 1271 / 1564
» Formalization of Time and Space
Sort
View
221
Voted
PDCAT
2007
Springer
16 years 1 months ago
Two Tree-Based Algorithms for Network Spare Capacity Design
Abstract. Survivable network design has become increasingly important due to the need for reliable communication service. Its main purpose is to provide cost-efficient spare capaci...
Hovhannes A. Harutyunyan, Calin D. Morosan, Yunzan...
180
Voted
SAT
2007
Springer
181views Hardware» more  SAT 2007»
16 years 1 months ago
Breaking Symmetries in SAT Matrix Models
Abstract. Symmetry occurs naturally in many computational problems. The use of symmetry breaking techniques for solving search problems reduces the search space and therefore is ex...
Inês Lynce, João P. Marques Silva
197
Voted
SCOPES
2007
Springer
16 years 1 months ago
Optimization of dynamic data structures in multimedia embedded systems using evolutionary computation
Embedded consumer devices are increasing their capabilities and can now implement new multimedia applications reserved only for powerful desktops a few years ago. These applicatio...
David Atienza, Christos Baloukas, Lazaros Papadopo...
UCS
2007
Springer
16 years 1 months ago
Detection of User Mode Shift in Home
A ubiquitous environment enable us to enjoy various services “anytime” ”anywhere”. However, “everyone” is not realized. We research an intelligent space “everyone” ...
Hiroyuki Yamahara, Hideyuki Takada, Hiromitsu Shim...
WEA
2007
Springer
117views Algorithms» more  WEA 2007»
16 years 1 months ago
Better Landmarks Within Reach
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...
Andrew V. Goldberg, Haim Kaplan, Renato Fonseca F....
« Prev « First page 1271 / 1564 Last » Next »