Sciweavers

529 search results - page 59 / 106
» Simple Random Logic Programs
Sort
View
ARGMAS
2004
Springer
14 years 3 months ago
An Argument-Based Framework to Model an Agent's Beliefs in a Dynamic Environment
Abstract. One of the most difficult problems in multiagent systems involves representing knowledge and beliefs of agents in dynamic environments. New perceptions modify an agent’...
Marcela Capobianco, Carlos Iván Chesñ...
CIDR
2011
230views Algorithms» more  CIDR 2011»
13 years 1 months ago
Consistency Analysis in Bloom: a CALM and Collected Approach
Distributed programming has become a topic of widespread interest, and many programmers now wrestle with tradeoffs between data consistency, availability and latency. Distributed...
Peter Alvaro, Neil Conway, Joe Hellerstein, Willia...
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
14 years 3 months ago
Finding needles in haystacks is harder with neutrality
This research presents an analysis of the reported successes of the Cartesian Genetic Programming method on a simplified form of the Boolean parity problem. We show the method of...
M. Collins
NMA
2010
13 years 7 months ago
Metaheuristics for the Asymmetric Hamiltonian Path Problem
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
João Pedro Pedroso
IFL
2007
Springer
162views Formal Methods» more  IFL 2007»
14 years 4 months ago
Testing Erlang Refactorings with QuickCheck
Abstract. Refactoring is a technique for improving the design of existing programs without changing their behaviour. Wrangler is a tool built at the University of Kent to support E...
Huiqing Li, Simon Thompson