Sciweavers

426 search results - page 75 / 86
» Possibilistic Stable Model Computing
Sort
View
ISORC
2003
IEEE
14 years 28 days ago
A Dynamic Shadow Approach for Mobile Agents to Survive Crash Failures
Fault tolerance schemes for mobile agents to survive agent server crash failures are complex since developers normally have no control over remote agent servers. Some solutions mo...
Simon Pears, Jie Xu, Cornelia Boldyreff
ICLP
2010
Springer
13 years 11 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
DKE
2010
167views more  DKE 2010»
13 years 7 months ago
The consistency extractor system: Answer set programs for consistent query answering in databases
We describe the Consistency Extractor System (ConsEx) that computes consistent answers to Datalog queries with negation posed to relational databases that may be inconsistent with...
Mónica Caniupán Marileo, Leopoldo E....
INFOCOM
2011
IEEE
12 years 11 months ago
Approximation algorithms for throughput maximization in wireless networks with delay constraints
—We study the problem of throughput maximization in multi-hop wireless networks with end-to-end delay constraints for each session. This problem has received much attention start...
Guanhong Pei, V. S. Anil Kumar, Srinivasan Parthas...
TSMC
2010
13 years 2 months ago
Cellular Learning Automata With Multiple Learning Automata in Each Cell and Its Applications
The cellular learning automaton (CLA), which is a4 combination of cellular automaton (CA) and learning automaton5 (LA), is introduced recently. This model is superior to CA because...
Hamid Beigy, Mohammad Reza Meybodi