Sciweavers

3630 search results - page 520 / 726
» How to Compare Treebanks
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
MVA
2000
234views Computer Vision» more  MVA 2000»
15 years 6 months ago
An automatic assessment scheme for steel quality inspection
This paper presents an automatic system for steel quality assessment, by measuring textural properties of carbide distributions. In current steel inspection, specially etched and p...
Klaus Wiltschi, Axel Pinz, Tony Lindeberg
PUC
2000
142views more  PUC 2000»
15 years 6 months ago
Context-Aware Telephony Over WAP
In this paper we introduce a novel approach to share context to enhance the social quality of remote mobile communication. We provide an analysis of how people start a conversation...
Albrecht Schmidt, Antti Takaluoma, Jani Mänty...
IJCIM
2002
141views more  IJCIM 2002»
15 years 6 months ago
STEP-based data schema for implementing product data management system
Currently, the challenge of implementing a product data management system (PDMS) is how to ensure system integration and product data exchange is shared between heterogeneous syste...
Shen-Chou Yeh, Chun-Fong You
ALGORITHMICA
1999
99views more  ALGORITHMICA 1999»
15 years 6 months ago
A Note on the Expected Time for Finding Maxima by List Algorithms
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
Luc Devroye