Sciweavers

13841 search results - page 2348 / 2769
» Algorithms and Constraint Programming
Sort
View
180
Voted
AMKM
2003
Springer
15 years 10 months ago
Automatically Generated DAML Markup for Semistructured Documents
The semantic web is becoming a realizable technology due to the efforts of researchers to develop semantic markup languages such as the DARPA Agent Markup Language (DAML). A major...
William Krueger, Jonathan Nilsson, Tim Oates, Timo...
131
Voted
CP
2003
Springer
15 years 10 months ago
Unrestricted Nogood Recording in CSP Search
Recently spectacular improvements in the performance of SAT solvers have been achieved through nogood recording (clause learning). In the CSP literature, on the other hand, nogood ...
George Katsirelos, Fahiem Bacchus
140
Voted
EMMCVPR
2003
Springer
15 years 10 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
ESA
2003
Springer
90views Algorithms» more  ESA 2003»
15 years 10 months ago
Packing a Trunk
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
Friedrich Eisenbrand, Stefan Funke, Joachim Reiche...
149
Voted
GD
2003
Springer
15 years 10 months ago
Characterizing Families of Cuts That Can Be Represented by Axis-Parallel Rectangles
A drawing of a family of cuts of a graph is an augmented drawing of the graph such that every cut in the family is represented by a simple closed curve and vice versa. We show tha...
Ulrik Brandes, Sabine Cornelsen, Dorothea Wagner
« Prev « First page 2348 / 2769 Last » Next »