Sciweavers

4378 search results - page 277 / 876
» On the Complexity of Ordered Colourings
Sort
View
ICDT
2007
ACM
126views Database» more  ICDT 2007»
16 years 25 days ago
Combining Incompleteness and Ranking in Tree Queries
Abstract. In many cases, users may want to consider incomplete answers to their queries. Often, however, there is an overwhelming number of such answers, even if subsumed answers a...
Benny Kimelfeld, Yehoshua Sagiv
AICT
2006
IEEE
163views Communications» more  AICT 2006»
16 years 23 days ago
A Methodology for Searching Reusable Business Processes
Web Services are becoming the prominent paradigm for distributed computing and electronic businesses. This makes natural the extension of the concepts at the base of the workflow ...
Francesco Calabrese, Giovanni Di Dio, Anna Rita Fa...
COCOON
2005
Springer
16 years 7 days ago
Power Domination Problem in Graphs
To monitor an electric power system by placing as few phase measurement units (PMUs) as possible is closely related to the famous vertex cover problem and domination problem in gr...
Chung-Shou Liao, Der-Tsai Lee
EDBTW
2004
Springer
16 years 2 days ago
Engineering Incentive Schemes for Ad Hoc Networks
In ad hoc networks, devices have to cooperate in order to compensate for the absence of infrastructure. Yet, autonomous devices tend to abstain from cooperation in order to save th...
Philipp Obreiter, Birgitta König-Ries, Georgi...
SAC
2010
ACM
15 years 11 months ago
An algorithm to generate the context-sensitive synchronized control flow graph
The verification of industrial systems specified with CSP often implies the analysis of many concurrent and synchronized components. The cost associated to these analyses is usu...
Marisa Llorens, Javier Oliver, Josep Silva, Salvad...