6598 search results - page 118 / 1320 » Graph Theory with Applications |
137
click to vote
VLDB
1994
ACM
15 years 8 months ago
1994
ACM
Advanced technical applications like routing systems or electrical network managementsystems introduce the need for complex manipulations of large size graphs. Efficiently support...
150
click to vote
APCSAC
2003
IEEE
15 years 9 months ago
2003
IEEE
This paper introduces a method which can be used to map applications written in a high level source language program, like C, to a coarse grain reconfigurable architecture, MONTIU...
135
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
140
Voted
COMBINATORICA
2008
15 years 4 months ago
2008
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
140
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The modeling and analysis of large networks of autonomous agents is an important topic with applications in many different disciplines. One way of modeling the development of such...