Sciweavers

492 search results - page 54 / 99
» The number of possibilities for random dating
Sort
View
SODA
2012
ACM
196views Algorithms» more  SODA 2012»
11 years 11 months ago
Polytope approximation and the Mahler volume
The problem of approximating convex bodies by polytopes is an important and well studied problem. Given a convex body K in Rd , the objective is to minimize the number of vertices...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
PVLDB
2010
120views more  PVLDB 2010»
13 years 7 months ago
Sampling the Repairs of Functional Dependency Violations under Hard Constraints
Violations of functional dependencies (FDs) are common in practice, often arising in the context of data integration or Web data extraction. Resolving these violations is known to...
George Beskales, Ihab F. Ilyas, Lukasz Golab
ISVLSI
2008
IEEE
104views VLSI» more  ISVLSI 2008»
14 years 3 months ago
Thermal-Aware Placement of Standard Cells and Gate Arrays: Studies and Observations
In high-performance VLSI circuits, the on-chip power densities are playing dominant role due to increased scaling of technology, increasing number of components, frequency and ban...
Prasun Ghosal, Tuhina Samanta, Hafizur Rahaman, Pa...
WSC
2001
13 years 10 months ago
Study of an ergodicity pitfall in multitrajectory simulation
Multitrajectory Simulation allows random events in a simulation to generate multiple trajectories. Management techniques have been developed to manage the choices of trajectories ...
John B. Gilmer Jr., Frederick J. Sullivan
CEC
2010
IEEE
13 years 9 months ago
On the role of modularity in evolutionary dynamic optimisation
The field of evolutionary dynamic optimisation is concerned with the application of evolutionary algorithms to dynamic optimisation problems. In recent years, numerous new algorith...
Philipp Rohlfshagen, Xin Yao