Sciweavers

925 search results - page 80 / 185
» A Solution to the Extended GCD Problem
Sort
View
PRICAI
2004
Springer
14 years 2 months ago
Constrained Ant Colony Optimization for Data Clustering
Processes that simulate natural phenomena have successfully been applied to a number of problems for which no simple mathematical solution is known or is practicable. Such meta-heu...
Shu-Chuan Chu, John F. Roddick, Che-Jen Su, Jeng-S...
ECCV
2010
Springer
14 years 2 months ago
A Stochastic Graph Evolution Framework for Robust Multi-Target Tracking
Maintaining the stability of tracks on multiple targets in video over extended time periods remains a challenging problem. A few methods which have recently shown encouraging resul...
ESOP
1999
Springer
14 years 1 months ago
Dynamic Programming via Static Incrementalization
Abstract. Dynamicprogramming is an importantalgorithm design technique. It is used for solving problems whose solutions involve recursively solving subproblems that share subsubpro...
Yanhong A. Liu, Scott D. Stoller
ENTCS
2010
75views more  ENTCS 2010»
13 years 9 months ago
A Lightweight Approach to Customizable Composition Operators for Java-like Classes
We propose a formal framework for extending a class-based language, equipped with a given class composition mechanism, to allow programmers to define their own derived composition...
Giovanni Lagorio, Marco Servetto, Elena Zucca
ICDCN
2011
Springer
13 years 17 days ago
Load Balanced Scalable Byzantine Agreement through Quorum Building, with Full Information
We address the problem of designing distributed algorithms for large scale networks that are robust to Byzantine faults. We consider a message passing, full information model: the ...
Valerie King, Steven Lonargan, Jared Saia, Amitabh...