Sciweavers

2266 search results - page 95 / 454
» Some Solutions to the Ignoring Problem
Sort
View
CORR
2010
Springer
190views Education» more  CORR 2010»
15 years 1 months ago
Stable marriage problems with quantitative preferences
The stable marriage problem is a well-known problem of matching men to women so that no man and woman, who are not married to each other, both prefer each other. Such a problem ha...
Maria Silvia Pini, Francesca Rossi, Kristen Brent ...
HT
1987
ACM
15 years 5 months ago
Exploring Representation Problems Using Hypertext
Hypertext is a technology well-suited to exploring different kinds of representational problems. It can be used first as an informal mechanism to describe the attributes of object...
Catherine C. Marshall
PDCN
2004
15 years 2 months ago
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar ...
125
Voted
WEA
2005
Springer
176views Algorithms» more  WEA 2005»
15 years 7 months ago
High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
Abstract. Many large-scale optimization problems rely on graph theoretic solutions; yet high-performance computing has traditionally focused on regular applications with high degre...
David A. Bader
139
Voted
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
15 years 1 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...