Sciweavers

780 search results - page 116 / 156
» Reasoning about sets using redescription mining
Sort
View
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
15 years 5 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens
APN
2010
Springer
15 years 5 months ago
Wendy: A Tool to Synthesize Partners for Services
Service-oriented computing proposes services as building blocks which can be composed to complex systems. To reason about the correctness of a service, its communication protocol n...
Niels Lohmann, Daniela Weinberg
WS
2010
ACM
14 years 11 months ago
Semantic web enabled software analysis
One of the most important decisions researchers face when analyzing software systems is the choice of a proper data analysis/exchange format. In this paper, we present EvoOnt, a s...
Jonas Tappolet, Christoph Kiefer, Abraham Bernstei...
AI
2000
Springer
15 years 15 days ago
EXPTIME tableaux for ALC
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r....
Francesco M. Donini, Fabio Massacci
120
Voted
SPAA
2009
ACM
15 years 9 months ago
At-most-once semantics in asynchronous shared memory
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...
Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicol...