1802 search results - page 155 / 361 » Complexity Theory for Operators in Analysis |
158
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Surprisingly, general search heuristics often solve combinatorial problems quite sufficiently, although they do not outperform specialized algorithms. Here, the behavior of simple...
165
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We study functional and multivalued dependencies over SQL tables with NOT NULL constraints. Under a no-information interpretation of null values we develop tools for reasoning. We...
140
click to vote
AUTOMATICA
2006
15 years 6 months ago
2006
The challenging problem in linear control theory is to describe the total set of parameters (controller coefficients or plant characteristics) which provide stability of a system....
171
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Internet search companies sell advertisement slots based on users' search queries via an auction. While there has been previous work on the auction process and its game-theor...
153
click to vote
GRID
2007
Springer
15 years 6 months ago
2007
Springer
It is often difficult to perform efficiently a collection of jobs with complex job dependencies due to temporal unpredictability of the grid. One way to mitigate the unpredictabili...