Sciweavers

2214 search results - page 149 / 443
» Complexity of Reasoning
Sort
View
145
Voted
WAOA
2010
Springer
232views Algorithms» more  WAOA 2010»
15 years 1 months ago
Approximation Algorithms for Domination Search
The r-domination search game on graphs is a game-theoretical approach to several graph and hypergraph parameters including treewidth and hypertree width. The task is to identify t...
Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thi...
135
Voted
ISOLA
2010
Springer
15 years 1 months ago
Towards a Connector Algebra
Interoperability of heterogeneous networked systems has yet to reach the maturity required by ubiquitous computing due to the technology-dependent nature of solutions. The Connect ...
Marco Autili, Chris Chilton, Paola Inverardi, Mart...
ENTCS
2006
113views more  ENTCS 2006»
15 years 3 months ago
A Large-Scale Experiment in Executing Extracted Programs
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...
Luís Cruz-Filipe, Pierre Letouzey
118
Voted
ICDT
1997
ACM
133views Database» more  ICDT 1997»
15 years 7 months ago
A Formal Foundation for Distributed Workflow Execution Based on State Charts
This paper provides a formal foundation for distributed workfiow executions. The state chart formalism is adapted to the needs of a workflow model in order to establish a basis for...
Dirk Wodtke, Gerhard Weikum
153
Voted
VMV
2003
123views Visualization» more  VMV 2003»
15 years 4 months ago
Using Feature Flow Fields for Topological Comparison of Vector Fields
In this paper we propose a new topology based metric for 2D vector fields. This metric is based on the concept of feature flow fields. We show that it incorporates both the cha...
Holger Theisel, Christian Rössl, Hans-Peter S...