Sciweavers

488 search results - page 55 / 98
» Compositional Verification of Probabilistic Systems Using Le...
Sort
View
GECCO
2006
Springer
198views Optimization» more  GECCO 2006»
15 years 2 months ago
Reward allotment in an event-driven hybrid learning classifier system for online soccer games
This paper describes our study into the concept of using rewards in a classifier system applied to the acquisition of decision-making algorithms for agents in a soccer game. Our a...
Yuji Sato, Yosuke Akatsuka, Takenori Nishizono
ATAL
2008
Springer
15 years 1 months ago
Synchronization protocols for reliable communication in fully distributed agent systems
In order to prevent misunderstandings within groups of interacting agents, it is necessary to ensure that the agents' beliefs regarding the overall state of the interaction a...
Hywel R. Dunn-Davies, Jim Cunningham, Shamimabi Pa...
TSE
2008
97views more  TSE 2008»
14 years 11 months ago
Timed Automata Patterns
Timed Automata have proven to be useful for specification and verification of real-time systems. System design using Timed Automata relies on explicit manipulation of clock variabl...
Jin Song Dong, Ping Hao, Shengchao Qin, Jun Sun 00...
MIR
2005
ACM
133views Multimedia» more  MIR 2005»
15 years 4 months ago
Probabilistic web image gathering
We propose a new method for automated large scale gathering of Web images relevant to specified concepts. Our main goal is to build a knowledge base associated with as many conce...
Keiji Yanai, Kobus Barnard
AAAI
2008
15 years 1 months ago
Clause Learning Can Effectively P-Simulate General Propositional Resolution
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
Philipp Hertel, Fahiem Bacchus, Toniann Pitassi, A...