383 search results - page 42 / 77 » Common Subexpressions in Constraint Models of Planning Probl... |
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...
RISE
2004
Springer
14 years 1 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
COR
2007
13 years 7 months ago
2007
We propose a hybrid method designed to solve a problem of dispatching and conflict free routing of automated guided vehicles (AGVs) in a flexible manufacturing system (FMS). Thi...
SAC
2003
ACM
14 years 28 days ago
2003
ACM
Many information systems are used in a problem solving context. Examples are travel planning systems, catalogs in electronic commerce, or agenda planning systems. They can be made...
CVPR
2008
IEEE
14 years 9 months ago
2008
IEEE
In the last decade, graph-cut optimization has been popular for a variety of pixel labeling problems. Typically graph-cut methods are used to incorporate a smoothness prior on a l...