Sciweavers

2517 search results - page 233 / 504
» Specifying Weak Sets
Sort
View
JAR
2000
123views more  JAR 2000»
15 years 6 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
CGF
1999
130views more  CGF 1999»
15 years 6 months ago
A Free Form Feature Taxonomy
In this paper the notion of free form feature for aesthetic design is presented. The design of industrial products constituted by free form surfaces is done by using CAD systems r...
M. Fontana, Franca Giannini, M. Meirana
SIAMDM
1998
95views more  SIAMDM 1998»
15 years 6 months ago
The Graphs with All Subgraphs T-Perfect
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
A. M. H. Gerards, F. Bruce Shepherd
TOCHI
1998
112views more  TOCHI 1998»
15 years 6 months ago
The Integrality of Speech in Multimodal Interfaces
A framework of complementary behavior has been proposed which maintains that direct manipulation and speech interfaces have reciprocal strengths and weaknesses. This suggests that...
Michael A. Grasso, David S. Ebert, Timothy W. Fini...
TON
1998
186views more  TON 1998»
15 years 6 months ago
Virtual path control for ATM networks with call level quality of service guarantees
— The configuration of virtual path (VP) connection services is expected to play an important role in the operation of large-scale asynchronous transfer mode (ATM) networks. A m...
Nikolaos Anerousis, Aurel A. Lazar