Sciweavers

988 search results - page 110 / 198
» Pseudo-Genetic Algorithmic Composition
Sort
View
STOC
2006
ACM
138views Algorithms» more  STOC 2006»
15 years 10 months ago
The PCP theorem by gap amplification
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
Irit Dinur
KBSE
2007
IEEE
15 years 4 months ago
Ensuring consistency in long running transactions
Flow composition languages permit the construction of longrunning transactions from collections of independent, atomic services. Due to environmental limitations, such transaction...
Jeffrey Fischer, Rupak Majumdar
HPDC
2002
IEEE
15 years 3 months ago
A Scalable QoS-Aware Service Aggregation Model for Peer-to-Peer Computing Grids
Peer-to-peer (P2P) computing grids consist of peer nodes that communicate directly among themselves through wide-area networks and can act as both clients and servers. These syste...
Xiaohui Gu, Klara Nahrstedt
GIS
2009
ACM
15 years 2 months ago
Focus+Glue+Context: an improved fisheye approach for web map services
This paper proposes a method for generating a Focus+Glue +Context map for Web map services by improving existing fisheye views methods for cartographic data. While many studies h...
Daisuke Yamamoto, Shotaro Ozeki, Naohisa Takahashi
GECCO
2005
Springer
112views Optimization» more  GECCO 2005»
15 years 3 months ago
Monotonic solution concepts in coevolution
Assume a coevolutionary algorithm capable of storing and utilizing all phenotypes discovered during its operation, for as long as it operates on a problem; that is, assume an algo...
Sevan G. Ficici