11328 search results - page 59 / 2266 » Timed Branching Processes |
155
click to vote
ICDT
2010
ACM
15 years 5 months ago
2010
ACM
When a query is evaluated under bag semantics, each answer is returned as many times as it has derivations. Bag semantics has long been recognized as important, especially when ag...
108
click to vote
AAAI
2010
15 years 4 months ago
2010
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents...
136
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
141
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Many models from a variety of areas involve the computation of an equilibrium or fixed point of some kind. Examples include Nash equilibria in games; market equilibria; computing o...
150
click to vote
JIRS
2008
15 years 3 months ago
2008
Abstract This paper proposes an approach for reducing the computational complexity of a model-predictive-control strategy for discrete-time hybrid systems with discrete inputs only...