5180 search results - page 204 / 1036 » Concurrency, Time, and Constraints |
145
click to vote
CPAIOR
2004
Springer
16 years 8 hour ago
2004
Springer
So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another t...
163
click to vote
AAAI
2004
15 years 8 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
174
Voted
DAM
2008
15 years 6 months ago
2008
: In this paper, we study a new problem of convex drawing of planar graphs with non-convex boundary constraints. It is proved that every triconnected plane graph whose boundary is ...
160
click to vote
IPL
2006
15 years 6 months ago
2006
We show that for a given set of m pairwise constraints over n variables, a variable assignment that satisfies maximally many m constraints (MAX-2-CSP) can be found in O(nm dn/3) t...
166
click to vote
PERCOM
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we study the problem of utility maximization in multi-hop wireless systems. To study the effect of wireless interference constraints on the utility maximization pro...