7495 search results - page 1317 / 1499 » Intelligent Document Processing |
190
click to vote
CCO
2001
Springer
15 years 11 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...
222
click to vote
FOSSACS
2001
Springer
15 years 11 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 ...
147
click to vote
IWANN
2001
Springer
15 years 11 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...
163
click to vote
SIGUCCS
2000
ACM
15 years 11 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...
155
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
The quality of student consultants and their development through training and education are major factors in determining long-term effectiveness of university Help Desk. To hire a...