566 search results - page 99 / 114 » Solution Reuse in Dynamic Constraint Satisfaction Problems |
129
click to vote
KDD
2012
ACM
13 years 2 months ago
2012
ACM
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
120
click to vote
CORR
2007
Springer
15 years 9 days ago
2007
Springer
Abstract— We develop a general framework for MAP estimation in discrete and Gaussian graphical models using Lagrangian relaxation techniques. The key idea is to reformulate an in...
89
Voted
BROADNETS
2005
IEEE
15 years 6 months ago
2005
IEEE
— Ethernet over SONET (EoS) is a popular approach for interconnecting geographically distant Ethernet segments using a SONET transport infrastructure. It typically uses virtual c...
108
click to vote
ICRA
1998
IEEE
15 years 4 months ago
1998
IEEE
Abstract--Manufacturing scheduling is an important but difficult task. In order to effectively solve such combinatorial optimization problems, this paper presents a novel Lagrangia...
134
Voted
RAS
2006
15 years 8 days ago
2006
This paper considers trajectory planning problems for autonomous robots in information gathering tasks. The objective of the planning is to maximize the information gathered withi...