Sciweavers

3221 search results - page 188 / 645
» Termination of Linear Programs
Sort
View
CONCUR
2005
Springer
15 years 12 months ago
Concurrent Clustered Programming
d Abstract) Vijay Saraswat1 and Radha Jagadeesan2 1 IBM T.J. Watson Research Lab 2 School of CTI, DePaul University Abstract. We present the concurrency and distribution primitives...
Vijay A. Saraswat, Radha Jagadeesan
ICS
2010
Tsinghua U.
15 years 10 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
GECCO
2007
Springer
213views Optimization» more  GECCO 2007»
16 years 16 days ago
Genetically programmed learning classifier system description and results
An agent population can be evolved in a complex environment to perform various tasks and optimize its job performance using Learning Classifier System (LCS) technology. Due to the...
Gregory Anthony Harrison, Eric W. Worden
GECCO
2004
Springer
15 years 11 months ago
Multi-agent Cooperation Using Genetic Network Programming with Automatically Defined Groups
In this paper, we propose a genetic network programming (GNP) architecture using a coevolution model called automatically defined groups (ADG). The GNP evolves networks for describ...
Tadahiko Murata, Takashi Nakamura
COCO
1993
Springer
133views Algorithms» more  COCO 1993»
15 years 10 months ago
On Span Programs
We introduce a linear algebraic model of computation, the Span Program, and prove several upper and lower bounds on it. These results yield the following applications in complexit...
Mauricio Karchmer, Avi Wigderson