Sciweavers

4860 search results - page 354 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
150
Voted
MOBICOM
2012
ACM
13 years 6 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
15 years 10 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard
149
Voted
GECCO
2003
Springer
129views Optimization» more  GECCO 2003»
15 years 8 months ago
Finding Building Blocks through Eigenstructure Adaptation
A fundamental aspect of many evolutionary approaches to synthesis of complex systems is the need to compose atomic elements into useful higher-level building blocks. However, the ...
Danica Wyatt, Hod Lipson
134
Voted
COMPGEOM
2005
ACM
15 years 5 months ago
Inequalities for the curvature of curves and surfaces
In this paper, we bound the difference between the total mean curvatures of two closed surfaces in R3 in terms of their total absolute curvatures and the Fr´echet distance betwee...
David Cohen-Steiner, Herbert Edelsbrunner
142
Voted
AGI
2008
15 years 5 months ago
A computational approximation to the AIXI model
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
Sergey Pankov