Sciweavers

602 search results - page 53 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
ISSRE
2000
IEEE
15 years 2 months ago
Building Trust into OO Components Using a Genetic Analogy
Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for bui...
Benoit Baudry, Vu Le Hanh, Jean-Marc Jéz&ea...
JDA
2010
122views more  JDA 2010»
14 years 4 months ago
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
We present subexponential parameterized algorithms on planar graphs for a family of problems of the following shape: given a graph, find a connected (induced) subgraph with bounde...
Ignasi Sau, Dimitrios M. Thilikos
74
Voted
IPPS
2010
IEEE
14 years 7 months ago
Efficient and scalable parallel reconstruction of sibling relationships from genetic data in wild populations
Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspri...
Saad I. Sheikh, Ashfaq A. Khokhar, Tanya Y. Berger...
EUROGP
2005
Springer
115views Optimization» more  EUROGP 2005»
15 years 3 months ago
Genetic Programming in Wireless Sensor Networks
Abstract. Wireless sensor networks (WSNs) are medium scale manifestations of a paintable or amorphous computing paradigm. WSNs are becoming increasingly important as they attain gr...
Derek M. Johnson, Ankur Teredesai, Robert T. Salta...
IOR
2007
106views more  IOR 2007»
14 years 9 months ago
Planning and Scheduling by Logic-Based Benders Decomposition
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve an important class of planning and scheduling problems. Tasks are allocated to faciliti...
John N. Hooker