5624 search results - page 809 / 1125 » On Conditional Covering Problem |
136
click to vote
IUI
2003
ACM
15 years 9 months ago
2003
ACM
We address the problem of improving the efficiency of natural language text input under degraded conditions (for instance, on PDAs or cell phones or by disabled users) by taking a...
124
click to vote
CP
2003
Springer
15 years 9 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
149
click to vote
DATE
2010
IEEE
15 years 9 months ago
2010
IEEE
—We present a new technique for statistical static timing analysis (SSTA) based on Markov chain Monte Carlo (MCMC), that allows fast and accurate estimation of the right-hand tai...
151
click to vote
PODS
2010
ACM
15 years 9 months ago
2010
ACM
Both semantic and type-based query optimization rely on the idea that queries often exhibit non-trivial rewritings if the state space of the database is restricted. Despite their ...
122
click to vote
DATE
2002
IEEE
15 years 9 months ago
2002
IEEE
We have developed a technique to compute a Quasi Static Schedule of a concurrent specification for the software partition of an embedded system. Previous work did not take into a...