Sciweavers

757 search results - page 94 / 152
» How to decide
Sort
View
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
14 years 4 months ago
Stability in the self-organized evolution of networks
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...
Thomas Jansen, Madeleine Theile
LPNMR
2007
Springer
14 years 4 months ago
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains
Recent research in answer-set programming (ASP) is concerned with the problem of finding faithful transformations of logic programs under the stable semantics. This is in particul...
Michael Fink, Reinhard Pichler, Hans Tompits, Stef...
TARK
2007
Springer
14 years 4 months ago
From conditional probability to the logic of doxastic actions
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
Alexandru Baltag, Sonja Smets
DEXAW
2006
IEEE
153views Database» more  DEXAW 2006»
14 years 4 months ago
Capturing and Using the Operational Semantics of Large Distributed Systems: Sharing Common Application Requirements in Virtual O
Organisations may wish to use a standards-defined distributed system in a global sense but also have a requirement for non-standard local behaviour. This reflects the production...
Nickolas J. G. Falkner, Paul D. Coddington, Andrew...
FOCS
2006
IEEE
14 years 4 months ago
Inclusion--Exclusion Algorithms for Counting Set Partitions
Given an n-element set U and a family of subsets S ⊆ 2U we show how to count the number of k-partitions S1 ∪ · · · ∪ Sk = U into subsets Si ∈ S in time 2nnO(1). The only...
Andreas Björklund, Thore Husfeldt