Sciweavers

845 search results - page 53 / 169
» Connecting Many-Sorted Theories
Sort
View
EOR
2008
136views more  EOR 2008»
15 years 6 months ago
Complexity and exact algorithms for vertex multicut in interval and bounded treewidth graphs
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
Jiong Guo, Falk Hüffner, Erhan Kenar, Rolf Ni...
MOBICOM
2012
ACM
13 years 8 months ago
Temporal reachability graphs
While a natural fit for modeling and understanding mobile networks, time-varying graphs remain poorly understood. Indeed, many of the usual concepts of static graphs have no obvi...
John Whitbeck, Marcelo Dias de Amorim, Vania Conan...
SEFM
2007
IEEE
16 years 11 days ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
ALDT
2009
Springer
144views Algorithms» more  ALDT 2009»
16 years 21 days ago
A Complete Conclusion-Based Procedure for Judgment Aggregation
Judgment aggregation is a formal theory reasoning about how a group of agents can aggregate individual judgments on connected propositions into a collective judgment on the same pr...
Gabriella Pigozzi, Marija Slavkovik, Leendert van ...
ASIAN
1998
Springer
111views Algorithms» more  ASIAN 1998»
15 years 10 months ago
A Comparison of Petri Net Semantics under the Collective Token Philosophy
In recent years, several semantics for place/transition Petri nets have been proposed that adopt the collective token philosophy. We investigate distinctions and similarities betwe...
Roberto Bruni, José Meseguer, Ugo Montanari...