Sciweavers

8413 search results - page 492 / 1683
» Ordering Problem Subgoals
Sort
View
ICDCS
2007
IEEE
16 years 1 months ago
Exploiting Symbolic Techniques in Automated Synthesis of Distributed Programs with Large State Space
Automated formal analysis methods such as program verification and synthesis algorithms often suffer from time complexity of their decision procedures and also high space complex...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
ICDM
2007
IEEE
97views Data Mining» more  ICDM 2007»
16 years 1 months ago
Supervised Learning by Training on Aggregate Outputs
Supervised learning is a classic data mining problem where one wishes to be be able to predict an output value associated with a particular input vector. We present a new twist on...
David R. Musicant, Janara M. Christensen, Jamie F....
WECWIS
2006
IEEE
78views ECommerce» more  WECWIS 2006»
16 years 25 days ago
Improving Patient Activity Schedules by Multi-agent Pareto Appointment Exchanging
We present a dynamic and distributed approach to the hospital patient scheduling problem: the multi-agent Pareto-improvement appointment exchanging algorithm, MPAEX. It respects t...
Ivan B. Vermeulen, Sander M. Bohte, D. J. A. Somef...
ATAL
2005
Springer
16 years 11 days ago
Towards a theory of "local to global" in distributed multi-agent systems (II)
a growing need to study abstract problems in distributed multi-agent systems in a systematic way, as well as to provide a qualitative mathematical framework in which to compare po...
Daniel Yamins
174
Voted
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
16 years 10 days ago
A genetic algorithm approach to the selection of near-optimal subsets from large sets
The problem attempted in this paper is to select a sample from a large set where the sample is required to have a particular average property. The problem can be expressed as an o...
P. Whiting, P. W. Poon, J. N. Carter