Sciweavers

19 search results - page 2 / 4
» Approximating the Non-contiguous Multiple Organization Packi...
Sort
View
FPL
2000
Springer
122views Hardware» more  FPL 2000»
13 years 9 months ago
A Placement Algorithm for FPGA Designs with Multiple I/O Standards
State-of-the-art FPGAs possess I/O resources that can be configured to support a wide variety of I/O standards [1]. In such devices, the I/O resources are grouped into banks. One o...
Jason Helge Anderson, Jim Saunders, Sudip Nag, Cha...
AAAI
1998
13 years 6 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
IAAI
2003
13 years 6 months ago
LAW: A Workbench for Approximate Pattern Matching in Relational Data
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
Michael Wolverton, Pauline Berry, Ian W. Harrison,...
CAAN
2004
Springer
13 years 10 months ago
Bandwidth Allocation in Networks: A Single Dual Update Subroutine for Multiple Objectives
We study the bandwidth allocation problem Maximize U(x), subject to Ax ≤ c; x ≥ 0 where U is a utility function, x is a bandwidth allocation vector, and Ax ≤ c represent the...
Sung-woo Cho, Ashish Goel
ALGOSENSORS
2007
Springer
13 years 11 months ago
Assigning Sensors to Missions with Demands
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
Amotz Bar-Noy, Theodore Brown, Matthew P. Johnson,...