1554 search results - page 227 / 311 » Parameterized Complexity and Approximation Algorithms |
121
Voted
CAV
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. When a model does not satisfy a given specification, a counterexample is produced by the model checker to demonstrate the failure. A user must then examine the counterexa...
141
click to vote
EDBT
2004
ACM
16 years 2 months ago
2004
ACM
We study the problem of answering queries over sources with limited access patterns. The problem is to decide whether a given query Q is feasible, i.e., equivalent to an executable...
128
Voted
ICPP
2007
IEEE
15 years 9 months ago
2007
IEEE
The real-time image forming in future, high-end synthetic aperture radar systems is an example of an application that puts new demands on computer architectures. The initial quest...
110
Voted
ECML
2007
Springer
15 years 9 months ago
2007
Springer
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
138
Voted
WINE
2007
Springer
15 years 8 months ago
2007
Springer
Internet search companies sell advertisement slots based on users’ search queries via an auction. Advertisers have to solve a complex optimization problem of how to place bids o...