Sciweavers

697 search results - page 76 / 140
» Improving EAs for Sequencing Problems
Sort
View
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 10 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
IJAIT
2008
99views more  IJAIT 2008»
13 years 9 months ago
Optimal Basic Block Instruction Scheduling for Multiple-Issue Processors Using Constraint Programming
Instruction scheduling is one of the most important steps for improving the performance of object code produced by a compiler. A fundamental problem that arises in instruction sch...
Abid M. Malik, Jim McInnes, Peter van Beek
ICML
2001
IEEE
14 years 10 months ago
Direct Policy Search using Paired Statistical Tests
Direct policy search is a practical way to solve reinforcement learning problems involving continuous state and action spaces. The goal becomes finding policy parameters that maxi...
Malcolm J. A. Strens, Andrew W. Moore
ISBI
2006
IEEE
14 years 10 months ago
Joint estimation in MRI using harmonic retrieval methods
One of the key factors affecting functional MRI image reconstruction is field inhomogeneity. It is desirable to estimate both the distortion-free MRI image and field map simultane...
Hien M. Nguyen, Robert L. Morrison Jr., Bradley P....
AAIM
2009
Springer
101views Algorithms» more  AAIM 2009»
14 years 3 months ago
Three Results on Frequency Assignment in Linear Cellular Networks
In the frequency assignment problem we are given a graph representing a wireless network and a sequence of requests, where each request is associated with a vertex. Each request h...
Marek Chrobak, Jiri Sgall