Sciweavers

2899 search results - page 498 / 580
» On the Complexity of Exclusion Algorithms for Optimization
Sort
View
ECCV
2008
Springer
15 years 11 months ago
Toward Global Minimum through Combined Local Minima
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
Ho Yub Jung, Kyoung Mu Lee, Sang Uk Lee
ATAL
2003
Springer
15 years 6 months ago
Role allocation and reallocation in multiagent teams: towards a practical analysis
Despite the success of the BDI approach to agent teamwork, initial role allocation (i.e. deciding which agents to allocate to key roles in the team) and role reallocation upon fai...
Ranjit Nair, Milind Tambe, Stacy Marsella
VLDB
1998
ACM
82views Database» more  VLDB 1998»
15 years 5 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
CF
2007
ACM
15 years 5 months ago
Parallel genomic sequence-search on a massively parallel system
In the life sciences, genomic databases for sequence search have been growing exponentially in size. As a result, faster sequencesearch algorithms to search these databases contin...
Oystein Thorsen, Brian E. Smith, Carlos P. Sosa, K...
SODA
2008
ACM
104views Algorithms» more  SODA 2008»
15 years 2 months ago
Fast and reliable reconstruction of phylogenetic trees with very short edges
Abstract Ilan Gronau Shlomo Moran Sagi Snir Phylogenetic reconstruction is the problem of reconstructing an evolutionary tree from sequences corresponding to leaves of that tree. ...
Ilan Gronau, Shlomo Moran, Sagi Snir