Sciweavers

1929 search results - page 47 / 386
» An Approach to Limit the Wynot Problem
Sort
View
ATAL
2001
Springer
15 years 10 months ago
Dynamic Distributed Resource Allocation: A Distributed Constraint Satisfaction Approach
Abstract. In distributed resource allocation a set of agents must assign their resources to a set of tasks. This problem arises in many real-world domains such as distributed senso...
Pragnesh Jay Modi, Hyuckchul Jung, Milind Tambe, W...
HPCC
2010
Springer
15 years 6 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
EUROGP
2007
Springer
135views Optimization» more  EUROGP 2007»
16 years 13 days ago
A Grammatical Genetic Programming Approach to Modularity in Genetic Algorithms
The ability of Genetic Programming to scale to problems of increasing difficulty operates on the premise that it is possible to capture regularities that exist in a problem environ...
Erik Hemberg, Conor Gilligan, Michael O'Neill, Ant...
SIAMAM
2008
131views more  SIAMAM 2008»
15 years 6 months ago
Asymptotic and Numerical Techniques for Resonances of Thin Photonic Structures
We consider the problem of calculating resonance frequencies and radiative losses of an optical resonator. The optical resonator is in the form of a thin membrane with variable die...
J. Gopalakrishnan, S. Moskow, F. Santosa
AUSAI
2003
Springer
15 years 11 months ago
Dynamic Agent Ordering in Distributed Constraint Satisfaction Problems
The distributed constraint satisfaction problem (CSP) is a general formalisation used to represent problems in distributed multiagent systems. To deal with realistic problems, mult...
Lingzhong Zhou, John Thornton, Abdul Sattar