Sciweavers

1943 search results - page 177 / 389
» Ordering Default Theories
Sort
View
FCT
2003
Springer
16 years 9 days ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
RECOMB
2003
Springer
16 years 7 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson
HICSS
2007
IEEE
109views Biometrics» more  HICSS 2007»
16 years 1 months ago
Agent-based Human-computer-interaction for Real-time Monitoring Systems in the Trucking Industry
Auto ID systems can replace time-consuming, costly and error-prone processes of human data entry and produce detailed real time information. However, they will add value only to t...
Elfriede Krauth, Jos van Hillegersberg, Steef L. v...
COCOON
2005
Springer
16 years 19 days ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
GECCO
2005
Springer
160views Optimization» more  GECCO 2005»
16 years 18 days ago
On the complexity of hierarchical problem solving
Competent Genetic Algorithms can efficiently address problems in which the linkage between variables is limited to a small order k. Problems with higher order dependencies can onl...
Edwin D. de Jong, Richard A. Watson, Dirk Thierens