4524 search results - page 147 / 905 » The Complexity of Global Constraints |
108
Voted
CP
2003
Springer
15 years 6 months ago
2003
Springer
A binary constraints network consists of a set of n variables, defined on domains of size at most d, and a set of e binary constraints. The binary constraint satisfaction problem ...
114
click to vote
PODS
2006
ACM
16 years 27 days ago
2006
ACM
Finding icebergs ? items whose frequency of occurrence is above a certain threshold ? is an important problem with a wide range of applications. Most of the existing work focuses ...
115
Voted
SIGGRAPH
1997
ACM
15 years 4 months ago
1997
ACM
Many problems in computer graphics and computer vision require accurate global visibility information. Previous approaches have typically been complicated to implement and numeric...
NIPS
1993
15 years 2 months ago
1993
Dynamic programming provides a methodology to develop planners and controllers for nonlinear systems. However, general dynamic programming is computationally intractable. We have ...
115
click to vote
ICSE
2011
IEEE-ACM
14 years 4 months ago
2011
IEEE-ACM
In this paper, we examined the impact of project-level configurational choices of globally distributed software teams on project productivity, quality, and profits. Our analysis u...