4926 search results - page 180 / 986 » Two Graph Algorithms On an Associative Computing Model |
229
click to vote
COR
2011
15 years 3 days ago
2011
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines...
193
click to vote
PODC
2012
ACM
13 years 7 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
170
click to vote
ALGORITHMICA
2008
15 years 5 months ago
2008
The profile of a graph is an integer-valued parameter defined via vertex orderings; it is known that the profile of a graph equals the smallest number of edges of an interval supe...
143
click to vote
ASPDAC
2005
ACM
15 years 7 months ago
2005
ACM
- To date, most high-level synthesis systems do not automatically solve present design problems, such as those related to timing associated with the physical implementation of mult...
140
click to vote
CGF
1999
15 years 4 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...