1593 search results - page 262 / 319 » A visual programming system for automated problem solving |
157
click to vote
CP
2004
Springer
15 years 11 months ago
2004
Springer
In CP literature combinatorial design problems such as sport scheduling, Steiner systems, error-correcting codes and more, are typically solved using Finite Domain (FD) models desp...
167
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
Complexity is the core problem of contemporary information technology, as the "artificial complicatedness" of its artefacts is exploding. Intellectually easy and economic...
156
click to vote
SAC
2010
ACM
16 years 25 days ago
2010
ACM
Polynomial ranges are commonly used for numerically solving polynomial systems with interval Newton solvers. Often ranges are computed using the convex hull property of the tensor...
194
click to vote
JACM
2011
14 years 9 months ago
2011
This paper is about a curious phenomenon. Suppose we have a data matrix, which is the superposition of a low-rank component and a sparse component. Can we recover each component i...
189
click to vote
ICDCS
2011
IEEE
14 years 5 months ago
2011
IEEE
—Popular Internet services are hosted by multiple geographically distributed datacenters. The location of the datacenters has a direct impact on the services’ response times, c...