Sciweavers

952 search results - page 190 / 191
» Computational complexity of stochastic programming problems
Sort
View
CIDR
2003
106views Algorithms» more  CIDR 2003»
14 years 11 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
AI
2006
Springer
14 years 9 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
TPDS
2008
124views more  TPDS 2008»
14 years 9 months ago
TROP: A Novel Approximate Link-State Dissemination Framework For Dynamic Survivable Routing in MPLS Networks
In this paper, a novel approximate link-state dissemination framework, called TROP, is proposed for shared backup path protection (SBPP) in Multi-Protocol Label Switching (MPLS) ne...
János Tapolcai, Pin-Han Ho, Anwar Haque
TMC
2010
130views more  TMC 2010»
14 years 7 months ago
SYNAPSE++: Code Dissemination in Wireless Sensor Networks Using Fountain Codes
—This paper presents SYNAPSE++, a system for over the air reprogramming of wireless sensor networks (WSNs). In contrast to previous solutions, which implement plain negative ackn...
Michele Rossi, Nicola Bui, Giovanni Zanca, Luca St...
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
15 years 10 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen