Sciweavers

1353 search results - page 157 / 271
» Streamlined Constraint Reasoning
Sort
View
SIGIR
2005
ACM
15 years 3 months ago
An exploration of axiomatic approaches to information retrieval
Existing retrieval models generally do not offer any guarantee for optimal retrieval performance. Indeed, it is even difficult, if not impossible, to predict a model’s empirica...
Hui Fang, ChengXiang Zhai
ATAL
2005
Springer
15 years 3 months ago
Bumping strategies for the multiagent agreement problem
We introduce the Multiagent Agreement Problem (MAP) to represent a class of multiagent scheduling problems. MAP is based on the Distributed Constraint Reasoning (DCR) paradigm and...
Pragnesh Jay Modi, Manuela M. Veloso
ICFEM
2004
Springer
15 years 3 months ago
Memory-Model-Sensitive Data Race Analysis
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...
Yue Yang, Ganesh Gopalakrishnan, Gary Lindstrom
PLDI
2000
ACM
15 years 2 months ago
Optimal instruction scheduling using integer programming
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
Kent D. Wilken, Jack Liu, Mark Heffernan
ISCA
1998
IEEE
123views Hardware» more  ISCA 1998»
15 years 2 months ago
Weak Ordering - A New Definition
A memory model for a shared memory, multiprocessor commonly and often implicitly assumed by programmers is that of sequential consistency. This model guarantees that all memory ac...
Sarita V. Adve, Mark D. Hill