2354 search results - page 129 / 471 » Assignment Problems |
115
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
We prove that any collection of n discs in which each one intersects at most k others, can be colored with at most O(log3 k) colors so that for each point p in the union of all di...
140
click to vote
SACMAT
2005
ACM
15 years 8 months ago
2005
ACM
With continuously growing numbers of applications, enterprises face the problem of efficiently managing the assignment of access permissions to their users. On the one hand, secur...
165
click to vote
PACT
1999
Springer
15 years 6 months ago
1999
Springer
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to ...
135
Voted
ANTSW
2004
Springer
15 years 7 months ago
2004
Springer
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
106
Voted
DAC
2009
ACM
16 years 3 months ago
2009
ACM
Digital microfluidic biochips have emerged as a popular alternative for laboratory experiments. To make the biochip feasible for practical applications, pin-count reduction is a k...