Sciweavers

3229 search results - page 355 / 646
» The Theory of Timed Automata
Sort
View
JAL
2002
99views more  JAL 2002»
15 years 6 months ago
Kayles and Nimbers
Kayles is a combinatorial game on graphs. Two players select alternatingly a vertex from a given graph G - a chosen vertex may not be adjacent or equal to an already chosen vertex...
Hans L. Bodlaender, Dieter Kratsch
DLOG
2010
15 years 4 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
16 years 1 months ago
Non-clairvoyant Scheduling Games
In a scheduling game, each player owns a job and chooses a machine to execute it. While the social cost is the maximal load over all machines (makespan), the cost (disutility) of ...
Christoph Dürr, Nguyen Kim Thang
BMCBI
2007
179views more  BMCBI 2007»
15 years 7 months ago
Automated smoother for the numerical decoupling of dynamics models
Background: Structure identification of dynamic models for complex biological systems is the cornerstone of their reverse engineering. Biochemical Systems Theory (BST) offers a pa...
Marco Vilela, Carlos Cristiano H. Borges, Susana V...
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
15 years 5 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt