Sciweavers

1047 search results - page 80 / 210
» Searching Without a Heuristic: Efficient Use of Abstraction
Sort
View
DICS
2006
13 years 11 months ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...
CORR
2004
Springer
108views Education» more  CORR 2004»
13 years 7 months ago
Efficiency Enhancement of Probabilistic Model Building Genetic Algorithms
Abstract. This paper presents two different efficiency-enhancement techniques for probabilistic model building genetic algorithms. The first technique proposes the use of a mutatio...
Kumara Sastry, David E. Goldberg, Martin Pelikan
VLDB
1992
ACM
111views Database» more  VLDB 1992»
13 years 12 months ago
Using Segmented Right-Deep Trees for the Execution of Pipelined Hash Joins
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative approach on query executio...
Ming-Syan Chen, Ming-Ling Lo, Philip S. Yu, Honest...
TPDS
2008
169views more  TPDS 2008»
13 years 7 months ago
Dynamic Resource Management in Energy Constrained Heterogeneous Computing Systems Using Voltage Scaling
An ad hoc grid is a wireless heterogeneous computing environment without a fixed infrastructure. This study considers wireless devices that have different capabilities, have limite...
Jong-Kook Kim, Howard Jay Siegel, Anthony A. Macie...
ATMOS
2008
139views Optimization» more  ATMOS 2008»
13 years 9 months ago
Efficient On-Trip Timetable Information in the Presence of Delays
Abstract. The search for train connections in state-of-the-art commercial timetable information systems is based on a static schedule. Unfortunately, public transportation systems ...
Lennart Frede, Matthias Müller-Hannemann, Mat...