Sciweavers

5595 search results - page 454 / 1119
» Approximation Algorithms for Clustering Problems
Sort
View
WSC
2004
15 years 9 months ago
An Event Graph Based Simulation and Scheduling Analysis of Multi-Cluster Tools
Simulation methods are extensively used in modeling complex scheduling problems. However, traditional layout of simulation models can become complicated when they are used to find...
Shengwei Ding, Jingang Yi
182
Voted
JIPS
2006
129views more  JIPS 2006»
15 years 7 months ago
ASVMRT: Materialized View Selection Algorithm in Data Warehouse
: In order to acquire a precise and quick response to an analytical query, proper selection of the views to materialize in the data warehouse is crucial. In traditional view select...
Jin-Hyuk Yang, In-Jeong Chung
238
Voted
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
16 years 1 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
IR
2010
15 years 6 months ago
A general approximation framework for direct optimization of information retrieval measures
Recently direct optimization of information retrieval (IR) measures becomes a new trend in learning to rank. Several methods have been proposed and the effectiveness of them has ...
Tao Qin, Tie-Yan Liu, Hang Li
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
15 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...