5214 search results - page 257 / 1043 » The Online Specialization Problem |
274
Voted
ICDE
2007
IEEE
16 years 7 months ago
2007
IEEE
Active Data Warehousing has emerged as an alternative to conventional warehousing practices in order to meet the high demand of applications for up-to-date information. In a nutsh...
138
click to vote
ISSAC
2007
Springer
16 years 8 days ago
2007
Springer
Approximate symbolic computation problems can be formulated as constrained or unconstrained optimization problems, for example: GCD [3, 8, 12, 13, 23], factorization [5, 10], and ...
190
Voted
AIPS
2003
15 years 7 months ago
2003
Despite a number of similarities, vehicle routing problems and scheduling problems are typically solved with different techniques. In this paper, we undertake a systematic study o...
142
click to vote
SOCO
2009
Springer
16 years 20 days ago
2009
Springer
How would a language look like that is specially designed for solving meta-programming problems in the software composition domain? We present requirements for and design of Rascal...
150
Voted
FOCS
1995
IEEE
15 years 9 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...