Sciweavers

9842 search results - page 323 / 1969
» Problem complexity
Sort
View
SRDS
2000
IEEE
15 years 11 months ago
Modeling Fault-Tolerant Mobile Agent Execution as a Sequence of Agreement Problems
Fault-tolerance is fundamental to the further development of mobile agent applications. In the context of mobile agents, fault-tolerance prevents a partial or complete loss of the...
Stefan Pleisch, André Schiper
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
UAI
2003
15 years 8 months ago
Monte-Carlo optimizations for resource allocation problems in stochastic network systems
Real-world distributed systems and networks are often unreliable and subject to random failures of its components. Such a stochastic behavior affects adversely the complexity of o...
Milos Hauskrecht, Tomás Singliar
AES
2006
Springer
106views Cryptology» more  AES 2006»
15 years 6 months ago
A grid-enabled problem solving environment for parallel computational engineering design
This paper describes the development and application of a piece of engineering software that provides a Problem Solving Environment (PSE) capable of launching, and interfacing wit...
C. E. Goodyer, Martin Berzins, Peter K. Jimack, L....
ORL
2000
77views more  ORL 2000»
15 years 6 months ago
Improved dynamic programs for some batching problems involving the maximum lateness criterion
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature th...
Albert P. M. Wagelmans, A. E. Gerodimos