Sciweavers

2030 search results - page 111 / 406
» Extremal Problems of Information Combining
Sort
View
FLAIRS
2007
13 years 12 months ago
Learning to Identify Global Bottlenecks in Constraint Satisfaction Search
Using information from failures to guide subsequent search is an important technique for solving combinatorial problems in domains such as boolean satisfiability (SAT) and constr...
Diarmuid Grimes, Richard J. Wallace
ECAI
2004
Springer
14 years 3 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
MOBIHOC
2003
ACM
14 years 9 months ago
The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way)
In wireless ad hoc networks, capacity can be traded for delay. This tradeoff has been the subject of a number of studies, mainly concentrating on the two extremes: either minimizi...
Tara Small, Zygmunt J. Haas
CGO
2006
IEEE
14 years 3 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...
MICCAI
2005
Springer
14 years 10 months ago
The Use of Unwrapped Phase in MR Image Segmentation: A Preliminary Study
This paper considers the problem of tissue classification in 3D MRI. More specifically, a new set of texture features, based on phase information, is used to perform the segmentati...
Pierrick Bourgeat, Jurgen Fripp, Andrew L. Janke, ...