Sciweavers

320 search results - page 36 / 64
» Run-Time Support for Optimizations Based on Escape Analysis
Sort
View
COLT
2006
Springer
15 years 1 months ago
Logarithmic Regret Algorithms for Online Convex Optimization
In an online convex optimization problem a decision-maker makes a sequence of decisions, i.e., chooses a sequence of points in Euclidean space, from a fixed feasible set. After ea...
Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal
82
Voted
WSC
2007
14 years 12 months ago
A model for contact center analysis and simulation
In this paper we depart from a set of simple assumptions regarding the behavior of a pool of customers associated with an enterprise’s contact center. We assume that the pool of...
Juan M. Huerta
89
Voted
SAC
2005
ACM
15 years 3 months ago
Performance analysis framework for large software-intensive systems with a message passing paradigm
The launch of new features for mobile phones is increasing and the product life cycle symmetrically decreasing in duration as higher levels of sophistication are reached. Therefor...
Christian Del Rosso
92
Voted
GECCO
2008
Springer
184views Optimization» more  GECCO 2008»
14 years 10 months ago
Analysis of mammography reports using maximum variation sampling
A genetic algorithm (GA) was developed to implement a maximum variation sampling technique to derive a subset of data from a large dataset of unstructured mammography reports. It ...
Robert M. Patton, Barbara G. Beckerman, Thomas E. ...
WWW
2008
ACM
14 years 9 months ago
Divide, Compress and Conquer: Querying XML via Partitioned Path-Based Compressed Data Blocks
We propose a novel Partition Path-Based (PPB) grouping strategy to store compressed XML data in a stream of blocks. In addition, we employ a minimal indexing scheme called Block S...
Wilfred Ng, Ho Lam Lau, Aoying Zhou