Sciweavers

1986 search results - page 391 / 398
» constraints 2006
Sort
View
AI
2006
Springer
13 years 8 months ago
Cut-and-solve: An iterative search strategy for combinatorial optimization problems
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
Sharlee Climer, Weixiong Zhang
AI
2006
Springer
13 years 8 months ago
Complexity of constructing solutions in the core based on synergies among coalitions
Coalition formation is a key problem in automated negotiation among self-interested agents, and other multiagent applications. A coalition of agents can sometimes accomplish thing...
Vincent Conitzer, Tuomas Sandholm
ALGORITHMICA
2006
139views more  ALGORITHMICA 2006»
13 years 8 months ago
CONQUEST: A Coarse-Grained Algorithm for Constructing Summaries of Distributed Discrete Datasets
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
Jie Chi, Mehmet Koyutürk, Ananth Grama
ARTMED
2006
86views more  ARTMED 2006»
13 years 8 months ago
Spatiotemporal reasoning about epidemiological data
Objective. In this article, we propose new methods to visualize and reason about spatiotemporal epidemiological data. Background. Efficient computerized reasoning about epidemics ...
Peter Z. Revesz, Shasha Wu
BIOINFORMATICS
2006
106views more  BIOINFORMATICS 2006»
13 years 8 months ago
Identification of biochemical networks by S-tree based genetic programming
Motivation: Most previous approaches to model biochemical networks havefocusedeither on the characterization of a networkstructurewith a number of components or on the estimation ...
Dong-Yeon Cho, Kwang-Hyun Cho, Byoung-Tak Zhang