Sciweavers

3663 search results - page 73 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2004
Springer
14 years 2 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
EOR
2010
110views more  EOR 2010»
13 years 8 months ago
A hybrid metaheuristic approach to solving the UBQP problem
This paper presents a hybrid metaheuristic approach (HMA) for solving the Unconstrained Binary Quadratic Programming (UBQP) problem. By incorporating a tabu search procedure into ...
Zhipeng Lü, Fred Glover, Jin-Kao Hao
MOR
2006
95views more  MOR 2006»
13 years 8 months ago
An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems
In multicriteria optimization, several objective functions, conflicting with each other, have to be minimized simultaneously. We propose a new efficient method for approximating t...
Jörg Fliege
ASP
2003
Springer
14 years 2 months ago
Suitable Graphs for Answer Set Programming
Abstract. Often graphs are used to investigate properties of logic programs. In general, different graphs represent different kinds of information of the corresponding programs. ...
Thomas Linke
APL
1993
ACM
14 years 26 days ago
The Role of APL and J in High-Performance Computation
Although multicomputers are becoming feasible for solving large problems, they are difficult to program: Extraction of parallelism from scalar languages is possible, but limited....
Robert Bernecky