Sciweavers

9842 search results - page 1459 / 1969
» The Complexity of the Matching-Cut Problem
Sort
View
EUROPAR
2007
Springer
16 years 1 months ago
Content-Based Publish/Subscribe Using Distributed R-Trees
Publish/subscribe systems provide a useful paradigm for selective data dissemination and most of the complexity related to addressing and routing is encapsulated within the network...
Silvia Bianchi, Pascal Felber, Maria Gradinariu
EUROPAR
2007
Springer
16 years 1 months ago
Negotiation Strategies Considering Opportunity Functions for Grid Scheduling
In Grid systems, nontrivial qualities of service have to be provided to users by the resource providers. However, resource management in a decentralized infrastructure is a complex...
Jiadao Li, Kwang Mong Sim, Ramin Yahyapour
FMCO
2007
Springer
129views Formal Methods» more  FMCO 2007»
16 years 1 months ago
Self Management for Large-Scale Distributed Systems: An Overview of the SELFMAN Project
As Internet applications become larger and more complex, the task of managing them becomes overwhelming. “Abnormal” events such as software updates, failures, attacks, and hots...
Peter Van Roy, Seif Haridi, Alexander Reinefeld, J...
FOSSACS
2007
Springer
16 years 1 months ago
PDL with Intersection and Converse Is 2 EXP-Complete
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
Stefan Göller, Markus Lohrey, Carsten Lutz
GECCO
2007
Springer
168views Optimization» more  GECCO 2007»
16 years 1 months ago
Rigorous analyses of simple diversity mechanisms
It is widely assumed and observed in experiments that the use of diversity mechanisms in evolutionary algorithms may have a great impact on its running time. Up to now there is no...
Tobias Friedrich, Nils Hebbinghaus, Frank Neumann
« Prev « First page 1459 / 1969 Last » Next »