Sciweavers

402 search results - page 74 / 81
» Complexity of Decision Problems for Simple Regular Expressio...
Sort
View
INFORMATIKTAGE
2008
13 years 10 months ago
Constraint Based Transformation Theory
During the last 25 years the complexity and functionality of software systems has increased dramatically. Software systems have to be updated and restructured continuously [22]. I...
Stefan Natelberg
TPHOL
1999
IEEE
14 years 27 days ago
Three Tactic Theorem Proving
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
Don Syme
SIGMETRICS
2010
ACM
195views Hardware» more  SIGMETRICS 2010»
14 years 17 days ago
CWS: a model-driven scheduling policy for correlated workloads
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
Giuliano Casale, Ningfang Mi, Evgenia Smirni
QUESTA
2010
112views more  QUESTA 2010»
13 years 7 months ago
Admission control for a multi-server queue with abandonment
In a M/M/N+M queue, when there are many customers waiting, it may be preferable to reject a new arrival rather than risk that arrival later abandoning without receiving service. O...
Yasar Levent Koçaga, Amy R. Ward
CONSTRAINTS
2010
153views more  CONSTRAINTS 2010»
13 years 6 months ago
Philosophy of the MiniZinc challenge
MiniZinc arose as a response to the extended discussion at CP2006 of the need for a standard modelling language for CP. This is a challenging problem, and we believe MiniZinc makes...
Peter J. Stuckey, Ralph Becket, Julien Fischer