Sciweavers

846 search results - page 80 / 170
» Dependent rounding and its applications to approximation alg...
Sort
View
AAAI
1998
15 years 2 months ago
Which Search Problems Are Random?
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
Tad Hogg
CIG
2005
IEEE
15 years 7 months ago
Co-evolutionary Strategies for an Alternating-Offer Bargaining Problem
Abstract- In this paper, we apply an Evolutionary Algorithm (EA) to solve the Rubinstein’s Basic AlternatingOffer Bargaining Problem, and compare our experimental results with it...
Nanlin Jin, Edward P. K. Tsang
PODS
2009
ACM
119views Database» more  PODS 2009»
16 years 2 months ago
Exceeding expectations and clustering uncertain data
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
Sudipto Guha, Kamesh Munagala
CVPR
2005
IEEE
16 years 3 months ago
Combining Object and Feature Dynamics in Probabilistic Tracking
Objects can exhibit different dynamics at different scales, and this is often exploited by visual tracking algorithms. A local dynamic model is typically used to extract image fea...
Leonid Taycher, John W. Fisher III, Trevor Darrell
ICCAD
2006
IEEE
133views Hardware» more  ICCAD 2006»
15 years 10 months ago
Stable and compact inductance modeling of 3-D interconnect structures
Recent successful techniques for the efficient simulation of largescale interconnect models rely on the sparsification of the inverse of the inductance matrix L. While there are...
Hong Li, Venkataramanan Balakrishnan, Cheng-Kok Ko...