1176 search results - page 188 / 236 » Implicit Abstraction Heuristics |
102
Voted
CIA
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Fredo is a generic domain-independent broker that creates valueadded information taking into account the preferences specified by its clients. Fredo uses ontology service...
84
Voted
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
119
click to vote
CP
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. Many real world problems, e.g. personnel scheduling and transportation planning, can be modeled naturally as Constrained Shortest Path Problems (CSPPs), i.e., as Shortest...
94
Voted
EVOW
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The Linear Ordering Problem (LOP) is an NP-hard combinatorial optimization problem that arises in a variety of applications and several algorithmic approaches to its solu...
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. The dense wavelength division multiplexing (DWDM) technique has been developed to provide a tremendous number of wavelengths/channels in an optical fiber. In the multi-c...