8132 search results - page 1480 / 1627 » Dependability, Abstraction, and Programming |
168
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...
187
click to vote
DIS
2009
Springer
16 years 29 days ago
2009
Springer
We analyze the dynamics of problem-solving in a framework which captures two key features of that activity. The first feature is that problem-solving is a social game where a numb...
170
click to vote
ISMM
2009
Springer
16 years 28 days ago
2009
Springer
Applying computer technology, such as computer vision in driver assistance, implies that processes and data are modeled as being discretized rather than being continuous. The area ...
178
click to vote
IWMM
2009
Springer
16 years 28 days ago
2009
Springer
Tracing algorithms visit reachable nodes in a graph and are central to activities such as garbage collection, marshalling etc. Traditional sequential algorithms use a worklist, re...
179
click to vote
CF
2009
ACM
16 years 27 days ago
2009
ACM
Chip Multiprocessor (CMP) memory systems suffer from the effects of destructive thread interference. This interference reduces performance predictability because it depends heavil...