Sciweavers

4860 search results - page 142 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
IDEAL
2005
Springer
14 years 3 months ago
Patterns in Complex Systems Modeling
The design, development, and use of complex systems models raises a unique class of challenges and potential pitfalls, many of which are commonly recurring problems. Over time, res...
Janet Wiles, James Watson
CORR
2008
Springer
76views Education» more  CORR 2008»
13 years 10 months ago
Constraint Complexity of Realizations of Linear Codes on Arbitrary Graphs
ABSTRACT. A graphical realization of a linear code C consists of an assignment of the coordinates of C to the vertices of a graph, along with a specification of linear state spaces...
Navin Kashyap
GECCO
2011
Springer
270views Optimization» more  GECCO 2011»
13 years 1 months ago
Geometric surrogate-based optimisation for permutation-based problems
In continuous optimisation, surrogate models (SMs) are used when tackling real-world problems whose candidate solutions are expensive to evaluate. In previous work, we showed that...
Alberto Moraglio, Yong-Hyuk Kim, Yourim Yoon
ALT
2003
Springer
14 years 7 months ago
Intrinsic Complexity of Uniform Learning
Inductive inference is concerned with algorithmic learning of recursive functions. In the model of learning in the limit a learner successful for a class of recursive functions mus...
Sandra Zilles
COCO
2003
Springer
162views Algorithms» more  COCO 2003»
14 years 3 months ago
Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...
Amit Chakrabarti, Subhash Khot, Xiaodong Sun