Sciweavers

9719 search results - page 1490 / 1944
» Answer Set Optimization
Sort
View
CASES
2004
ACM
16 years 1 months ago
Balancing design options with Sherpa
Application specific processors offer the potential of rapidly designed logic specifically constructed to meet the performance and area demands of the task at hand. Recently, t...
Timothy Sherwood, Mark Oskin, Brad Calder
ESA
2004
Springer
126views Algorithms» more  ESA 2004»
16 years 1 months ago
Path Decomposition Under a New Cost Measure with Applications to Optical Network Design
We introduce a problem directly inspired by its application to DWDM (dense wavelength division multiplexing) network design. We are given a set of demands to be carried over a netw...
Elliot Anshelevich, Lisa Zhang
GECCO
2003
Springer
16 years 27 days ago
A Kernighan-Lin Local Improvement Heuristic That Solves Some Hard Problems in Genetic Algorithms
We present a Kernighan-Lin style local improvement heuristic for genetic algorithms. We analyze the run-time cost of the heuristic. We demonstrate through experiments that the heur...
William A. Greene
IPSN
2003
Springer
16 years 26 days ago
A Distributed Algorithm for Waking-up in Heterogeneous Sensor Networks
In this paper we present a distributed, application-morphable, algorithm for waking up appropriate sensor nodes in a heterogeneous sensor network. We assume a sensor field consisti...
Akis Spyropoulos, Cauligi S. Raghavendra, Viktor K...
EDBT
2010
ACM
149views Database» more  EDBT 2010»
16 years 24 days ago
Statistics-based parallelization of XPath queries in shared memory systems
The wide availability of commodity multi-core systems presents an opportunity to address the latency issues that have plaqued XML query processing. However, simply executing multi...
Rajesh Bordawekar, Lipyeow Lim, Anastasios Kements...
« Prev « First page 1490 / 1944 Last » Next »