Sciweavers

4137 search results - page 461 / 828
» On the number of matchings of a tree
Sort
View
ARTCOM
2009
IEEE
16 years 1 months ago
An Efficient Bidirectional Frame Prediction Using Particle Swarm Optimization Technique
—This paper presents a Novel Bidirectional motion estimation technique, which is based on the Particle swarm optimization algorithm. Particle swarm optimization (PSO) is a popula...
D. Ranganadham, Pavan Kumar Gorpuni
FOCS
2007
IEEE
16 years 1 months ago
Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
Daniel Stefankovic, Santosh Vempala, Eric Vigoda
ANCS
2006
ACM
16 years 26 days ago
CAMP: fast and efficient IP lookup architecture
A large body of research literature has focused on improving the performance of longest prefix match IP-lookup. More recently, embedded memory based architectures have been propos...
Sailesh Kumar, Michela Becchi, Patrick Crowley, Jo...
ICN
2005
Springer
16 years 10 days ago
Scheduling Algorithms for Input Queued Switches Using Local Search Technique
Input Queued switches have been very well studied in the recent past. The Maximum Weight Matching (MWM) algorithm is known to deliver 100% throughput under any admissible traffic. ...
Yanfeng Zheng, Simin He, Shutao Sun, Wen Gao
SIGECOM
2003
ACM
128views ECommerce» more  SIGECOM 2003»
16 years 4 days ago
Solving combinatorial exchanges: optimality via a few partial bids
We investigate the problem of matching buyers and sellers in a multi-item multi-unit combinatorial exchange so as to maximize either the surplus (revenue minus cost) or the tradin...
Anshul Kothari, Tuomas Sandholm, Subhash Suri