Sciweavers

874 search results - page 58 / 175
» Computing Weighted Solutions in Answer Set Programming
Sort
View
JCO
1998
136views more  JCO 1998»
15 years 13 days ago
A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem
Abstract. A Greedy Randomized Adaptive Search Procedure (GRASP) is a randomized heuristic that has produced high quality solutions for a wide range of combinatorial optimization pr...
Panos M. Pardalos, Tianbing Qian, Mauricio G. C. R...
VL
2008
IEEE
15 years 7 months ago
End-user programming to support classroom activities on small devices
We believe it is unreasonable to assume that all students will own a laptop. One potential solution is to depend on the students to bring whatever computing devices (cell phones, ...
Craig Prince
MOR
2008
169views more  MOR 2008»
15 years 22 days ago
The Flow Set with Partial Order
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
Alper Atamtürk, Muhong Zhang
104
Voted
ASP
2003
Springer
15 years 6 months ago
Properties of maximal cliques of a pair-wise compatibility graph for three nonmonotonic reasoning system
In this paper we define the notion of a compatibility relation so as to have a common framework for three nonmonotonic reasoning systems: normal logic programming, extended logic ...
Robert E. Mercer, Vincent Risch
88
Voted
ISMB
1994
15 years 2 months ago
A Restriction Mapping Engine Using Constraint Logic Programming
Restrictionmappinggenerallyrequires the applicationof information from various digestions by restriction enzymesto find solution sets. Weuse boththe predicate calculusandconstrain...
Trevor I. Dix, Chut N. Yee