1090 search results - page 174 / 218 » Priority Algorithms for Graph Optimization Problems |
116
Voted
ICCAD
2008
IEEE
15 years 11 months ago
2008
IEEE
— This paper presents a fast analytical method for estimating the throughput of pipelined asynchronous systems, and then applies that method to develop a fast solution to the pro...
173
Voted
ECCV
2008
Springer
16 years 14 days ago
2008
Springer
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 ...
107
click to vote
CORR
2007
Springer
15 years 2 months ago
2007
Springer
— We are given an equal number of mobile robotic agents, and distinct target locations. Each agent has simple integrator dynamics, a limited communication range, and knowledge of...
137
Voted
MDM
2009
Springer
15 years 8 months ago
2009
Springer
— This work aims at minimize the cost of answering snapshot multi-predicate queries in high-communication-cost networks. High-communication-cost (HCC) networks is a family of net...
186
Voted
MFCS
2010
Springer
15 years 18 days ago
2010
Springer
The problem of finding a satisfying assignment for a 2-SAT formula that minimizes the number of variables that are set to 1 (min ones 2–sat) is NP-complete. It generalizes the w...