Sciweavers

Share
DATE
1997
IEEE
89views Hardware» more  DATE 1997»
9 years 2 months ago
Cone-based clustering heuristic for list-scheduling algorithms
List scheduling algorithms attempt to minimize latency under resource constraints using a priority list. We propose a new heuristic that can be used in conjunction with any priori...
Sriram Govindarajan, Ranga Vemuri
ICGI
1998
Springer
9 years 2 months ago
A Stochastic Search Approach to Grammar Induction
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
Hugues Juillé, Jordan B. Pollack
ISMIS
1999
Springer
9 years 2 months ago
Improving Backtrack Search for SAT by Means of Redundancy
In this paper, a new heuristic that can be grafted to many of the most e cient branching strategies for Davis and Putnam procedures for SAT is described. This heuristic gives a hig...
Laure Brisoux, Éric Grégoire, Lakhda...
CP
2000
Springer
9 years 2 months ago
New Search Heuristics for Max-CSP
Abstract. This paper evaluates the power of a new scheme that generates search heuristics mechanically. This approach was presented and evaluated rst in the context of optimization...
Kalev Kask
INFOCOM
2000
IEEE
9 years 2 months ago
Max-Min D-Cluster Formation in Wireless Ad Hoc Networks
— An ad hoc network may be logically represented as a set of clusters. The clusterheads form a -hop dominating set. Each node is at most hops from a clusterhead. Clusterheads for...
Alan D. Amis, Ravi Prakash, Dung Huynh, Thai Vuong
ICDCS
2000
IEEE
9 years 2 months ago
Scheduling Heuristics for Data Requests in an Oversubscribed Network with Priorities and Deadlines
Providing up-to-date input to users’ applications is an important data management problem for a distributed computing environment, where each data storage location and intermedi...
Mitchell D. Theys, Noah Beck, Howard Jay Siegel, M...
ISHPC
2003
Springer
9 years 3 months ago
Evaluating Heuristic Scheduling Algorithms for High Performance Parallel Processing
Most cluster systems used in high performance computing do not allow process relocation at run-time. Finding an allocation that results in minimal completion time is NP-hard and (n...
Lars Lundberg, Magnus Broberg, Kamilla Klonowska
GECCO
2003
Springer
9 years 3 months 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
INFOCOM
2003
IEEE
9 years 3 months ago
Distributed Network Monitoring with Bounded Link Utilization in IP Networks
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
Erran L. Li, Marina Thottan, Bin Yao, Sanjoy Paul
SBIA
2004
Springer
9 years 3 months ago
Heuristically Accelerated Q-Learning: A New Approach to Speed Up Reinforcement Learning
This work presents a new algorithm, called Heuristically Accelerated Q–Learning (HAQL), that allows the use of heuristics to speed up the well-known Reinforcement Learning algori...
Reinaldo A. C. Bianchi, Carlos H. C. Ribeiro, Anna...
books