3958 search results - page 91 / 792 » Dynamic Graph Algorithms with Applications |
152
click to vote
AI
2003
Springer
15 years 10 months ago
2003
Springer
Many AI tasks can be formalized as constraint satisfaction problems (CSPs), which involve finding values for variables subject to constraints. While solving a CSP is an NP-complet...
210
click to vote
OOPSLA
2000
Springer
15 years 8 months ago
2000
Springer
Propagation-based call graph construction algorithms have been studied intensively in the 1990s, and differ primarily in the number of sets that are used to approximate run-time v...
151
Voted
CC
2006
Springer
15 years 8 months ago
2006
Springer
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
160
click to vote
ICPP
2002
IEEE
15 years 10 months ago
2002
IEEE
Power aware computing has become popular recently and many techniques have been proposed to manage the energy consumption for traditional real-time applications. We have previousl...
142
click to vote
ICCS
2007
Springer
15 years 8 months ago
2007
Springer
Knowledge representation (KR) is used to store and retrieve meaningful data. This data is saved using dynamic data structures that are suitable for the style of KR being implemente...