Sciweavers

15660 search results - page 133 / 3132
» The Unbalance of Set Systems
Sort
View
SPAA
2012
ACM
13 years 9 months ago
Allowing each node to communicate only once in a distributed system: shared whiteboard models
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...
Florent Becker, Adrian Kosowski, Nicolas Nisse, Iv...
EJC
2007
15 years 6 months ago
On separating systems
We sharpen a result of Hansel on separating set systems. We also extend a theorem of Spencer on completely separating systems by proving an analogue of Hansel’s result.
Béla Bollobás, Alex D. Scott
AUTOMATICA
2008
94views more  AUTOMATICA 2008»
15 years 6 months ago
Reachability analysis of continuous-time piecewise affine systems
This paper proposes an algorithm for the characterization of reachable sets of states for continuous-time piecewise affine systems. Given a model of the system and a bounded set o...
Abdullah Hamadeh, Jorge Goncalves
LPNMR
2005
Springer
16 years 1 days ago
SELP - A System for Studying Strong Equivalence Between Logic Programs
Abstract. This paper describes a system called SELP for studying strong equivalence in answer set logic programming. The basic function of the system is to check if two given groun...
Yin Chen, Fangzhen Lin, Lei Li
LPNMR
1999
Springer
15 years 10 months ago
Representing Transition Systems by Logic Programs
This paper continues the line of research on representing actions, on the automation of commonsense reasoning and on planning that deals with causal theories and with action langua...
Vladimir Lifschitz, Hudson Turner