3090 search results - page 601 / 618 » Document Processing with LinkIT |
WWW
2009
ACM
15 years 2 months ago
2009
ACM
Fully automatic methods that extract lists of objects from the Web have been studied extensively. Record extraction, the first step of this object extraction process, identifies...
85
Voted
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
121
click to vote
FOSSACS
2001
Springer
15 years 2 months ago
2001
Springer
Hierarchical Message Sequence Charts are a well-established formalism to specify telecommunication protocols. In this model, numerous undecidability results were obtained recently ...
IWANN
2001
Springer
15 years 2 months ago
2001
Springer
This paper looks upon the standard genetic algorithm as an artificial self-organizing process. With the purpose to provide concepts that make the algorithm more open for scalabili...
SIGUCCS
2000
ACM
15 years 2 months ago
2000
ACM
The University of Pittsburgh's Computing Services and Systems Development organization is focused on the needs of the faculty and student population, totaling nearly 40,000 u...