2835 search results - page 351 / 567 » Automatic Question Answering |
194
click to vote
ICS
2009
Tsinghua U.
16 years 1 months ago
2009
Tsinghua U.
“Is transactional memory useful?” is the question that cannot be answered until we provide substantial applications that can evaluate its capabilities. While existing TM appli...
164
click to vote
COCOON
2009
Springer
16 years 1 months ago
2009
Springer
In [3], the authors introduced the Generalised Character Compatibility Problem as a generalisation of the Perfect Phylogeny Problem for a set of species. This generalised problem t...
158
click to vote
INFOCOM
2007
IEEE
16 years 27 days ago
2007
IEEE
Abstract— The effectiveness of service provisioning in largescale networks is highly dependent on the number and location of service facilities deployed at various hosts. The cla...
185
click to vote
GD
2005
Springer
16 years 3 days ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...
188
click to vote
IFL
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. Tracing a computation is a key method for program comprehension and debugging. Hat is a tracing system for Haskell 98 programs. During a computation a trace is recorded i...