536 search results - page 56 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
157
click to vote
GECCO
2007
Springer
16 years 8 days ago
2007
Springer
The work addresses the problem of identifying the epistatic linkage of a function from high cardinality alphabets to the real numbers. It is a generalization of Heckendorn and Wri...
168
click to vote
SPAA
2009
ACM
16 years 3 months ago
2009
ACM
Abstract. At-most-once semantics is one of the standard models for object access in decentralized systems. Accessing an object, such as altering the state of the object by means of...
161
click to vote
SAS
2007
Springer
16 years 7 days ago
2007
Springer
Interval analysis seeks static lower and upper bounds on the values of program variables. These bounds are useful, especially for inferring invariants to prove buffer overflow ch...
134
click to vote
RTCSA
2000
IEEE
15 years 10 months ago
2000
IEEE
One of the hard problems in maintaining real-time systems requirements is to keep track of the impact of resource usage on the applications. Often times, it is not sufficient to ...
168
click to vote
IJAOSE
2010
15 years 3 months ago
2010
An approach for handling the complex dynamics of a multi-agent system is based on distinguishing aggregation levels. The behaviour at a given aggregation level is specified by a se...