Sciweavers

4342 search results - page 576 / 869
» Improved Algorithms for Optimal Embeddings
Sort
View
ICDT
2005
ACM
128views Database» more  ICDT 2005»
16 years 7 days ago
The Pipelined Set Cover Problem
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
Kamesh Munagala, Shivnath Babu, Rajeev Motwani, Je...
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
15 years 11 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
SC
2009
ACM
16 years 1 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
16 years 26 days ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
GBRPR
2005
Springer
16 years 7 days ago
Approximating the Problem, not the Solution: An Alternative View of Point Set Matching
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
Tibério S. Caetano, Terry Caelli