2107 search results - page 180 / 422 » Computing Small Search Numbers in Linear Time |
109
click to vote
SIGUCCS
2000
ACM
15 years 7 months ago
2000
ACM
The School of Architecture and Allied Arts at the University of Oregon consists of nine departments and programs with 5000 students, 160 faculty, and a few dozen staff. When I cam...
130
Voted
APN
2004
Springer
15 years 9 months ago
2004
Springer
Generating the reachability set is one of the most commonly required step when analyzing the logical or stochastic behavior of a system modeled with Petri nets. Traditional “expl...
226
Voted
SLS
2009
Springer
15 years 8 months ago
2009
Springer
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though...
145
Voted
PEPM
2009
ACM
16 years 20 days ago
2009
ACM
Many applications need to respond to incremental modifications to data. Being incremental, such modification often require incremental modifications to the output, making it po...
146
Voted
SIGGRAPH
1995
ACM
15 years 7 months ago
1995
ACM
Most recent rendering research has concentrated on two subproblems: modeling the reflection of light from materials, and calculating the direct and indirect illumination from lig...