5263 search results - page 560 / 1053 » Open Constraint Optimization |
170
click to vote
PODC
2003
ACM
16 years 11 days ago
2003
ACM
Routing topologies for distributed hashing in peer-to-peer networks are classified into two categories: deterministic and randomized. A general technique for constructing determi...
139
click to vote
ERSHOV
2003
Springer
16 years 10 days ago
2003
Springer
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
135
click to vote
HICSS
2002
IEEE
16 years 2 days ago
2002
IEEE
Research suggests that in order for GSS to be deployed successfully over the long term, it must be integrated into the daily work practices of an organization, in support of repea...
182
click to vote
ICALP
2010
Springer
15 years 12 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
176
click to vote
ICCAD
1999
IEEE
15 years 11 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...