Sciweavers

154 search results - page 20 / 31
» Algorithms for Implicit Hitting Set Problems
Sort
View
CSDA
2006
84views more  CSDA 2006»
14 years 9 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
15 years 9 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
IPCO
2007
108views Optimization» more  IPCO 2007»
14 years 11 months ago
Robust Combinatorial Optimization with Exponential Scenarios
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S...
ASPDAC
2006
ACM
98views Hardware» more  ASPDAC 2006»
15 years 3 months ago
Timing-driven placement based on monotone cell ordering constraints
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
Chanseok Hwang, Massoud Pedram
AAAI
2006
14 years 11 months ago
On the Difficulty of Modular Reinforcement Learning for Real-World Partial Programming
In recent years there has been a great deal of interest in "modular reinforcement learning" (MRL). Typically, problems are decomposed into concurrent subgoals, allowing ...
Sooraj Bhat, Charles Lee Isbell Jr., Michael Matea...