14548 search results - page 2754 / 2910 » The Optimal Path-Matching Problem |
144
click to vote
CPHYSICS
2007
15 years 6 months ago
2007
The UCLA Parallel Particle-in-Cell (UPIC) Framework, is designed to provide trusted components for building a variety of parallel Particle-in-Cell (PIC) codes. It is based on the ...
157
click to vote
JAIR
2006
15 years 6 months ago
2006
A -model is a satisfying assignment of a Boolean formula for which any small alteration, such as a single bit flip, can be repaired by flips to some small number of other bits, yi...
164
click to vote
JAIR
2006
15 years 6 months ago
2006
We characterize the search landscape of random instances of the job shop scheduling problem (JSP). Specifically, we investigate how the expected values of (1) backbone size, (2) d...
206
click to vote
CSL
2007
Springer
15 years 6 months ago
2007
Springer
In a spoken dialog system, determining which action a machine should take in a given situation is a difficult problem because automatic speech recognition is unreliable and hence ...
191
click to vote
JPDC
2008
15 years 6 months ago
2008
This paper addresses the problem of porting distributed parallel applications to the Grid. One of the challenges we address is the change from static homogeneous cluster environmen...