Sciweavers

134 search results - page 10 / 27
» An Optimal Rebuilding Strategy for an Incremental Tree Probl...
Sort
View
ICML
2004
IEEE
15 years 11 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
ICDE
1996
IEEE
126views Database» more  ICDE 1996»
16 years 9 days ago
Using Object-Oriented Principles to Optimize Update Propagation to Materialized Views
View materialization is known to be a valuable technique for performance optimization in relational databases, and much work has been done addressing the problem of consistently m...
Harumi A. Kuno, Elke A. Rundensteiner
DAM
2008
135views more  DAM 2008»
14 years 11 months ago
Edge ranking and searching in partial orders
: We consider a problem of searching an element in a partially ordered set (poset). The goal is to find a search strategy which minimizes the number of comparisons. Ben-Asher, Farc...
Dariusz Dereniowski
AUTOMATICA
2008
127views more  AUTOMATICA 2008»
14 years 11 months ago
On decentralized negotiation of optimal consensus
A consensus problem consists of finding a distributed control strategy that brings the state or output of a group of agents to a common value, a consensus point. In this paper, we...
Björn Johansson, Alberto Speranzon, Mikael Jo...
GECCO
2004
Springer
211views Optimization» more  GECCO 2004»
15 years 4 months ago
Node-Depth Encoding for Evolutionary Algorithms Applied to Network Design
Network design involves several areas of engineering and science. Computer networks, electrical circuits, transportation problems, and phylogenetic trees are some examples. In gene...
Alexandre C. B. Delbem, André Carlos Ponce ...