Sciweavers

2060 search results - page 245 / 412
» Some Applications of Coding Theory in Computational Complexi...
Sort
View
PDP
2005
IEEE
15 years 10 months ago
Practicable Layouts for Optimal Circulant Graphs
Circulant graphs have been deeply studied in technical literature. Midimew networks are a class of distancerelated optimal circulant graphs of degree four which have applications ...
Enrique Vallejo, Ramón Beivide, Carmen Mart...
CDC
2009
IEEE
122views Control Systems» more  CDC 2009»
15 years 8 months ago
Air traffic management with target windows: An approach using reachability
Abstract-- We present the applications of reachability methods and computational tools based on game theory to a problem in air traffic management. The use of such methods in air t...
Kostas Margellos, John Lygeros
HPDC
2010
IEEE
15 years 5 months ago
Massive Semantic Web data compression with MapReduce
The Semantic Web consists of many billions of statements made of terms that are either URIs or literals. Since these terms usually consist of long sequences of characters, an effe...
Jacopo Urbani, Jason Maassen, Henri E. Bal
SODA
2010
ACM
190views Algorithms» more  SODA 2010»
16 years 2 months ago
One-Counter Markov Decision Processes
We study the computational complexity of some central analysis problems for One-Counter Markov Decision Processes (OC-MDPs), a class of finitely-presented, countable-state MDPs. O...
Tomas Brazdil, Vaclav Brozek, Kousha Etessami, Ant...
EDBT
2000
ACM
15 years 8 months ago
Performance and Availability Assessment for the Configuration of Distributed Workflow Management Systems
Workflow management systems (WFMSs) that are geared for the orchestration of enterprise-wide or even "virtual-enterprise"-style business processes across multiple organi...
Michael Gillmann, Jeanine Weißenfels, Gerhar...