5263 search results - page 783 / 1053 » Open Constraint Optimization |
281
click to vote
SIGMOD
2007
ACM
16 years 7 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
211
click to vote
SPAA
2009
ACM
16 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
256
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
231
click to vote
IPPS
2003
IEEE
16 years 15 days ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
214
click to vote
WISE
2002
Springer
16 years 4 days ago
2002
Springer
To make the World Wide Web machine-understandable there is a strong demand both for languages describing metadata and for languages querying metadata. The Resource Description Fram...