Sciweavers

1963 search results - page 92 / 393
» Applications of Preferences using Answer Set Programming
Sort
View
JCO
1998
136views more  JCO 1998»
15 years 2 months 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...
AAAI
2007
15 years 5 months ago
Nonmyopic Informative Path Planning in Spatio-Temporal Models
In many sensing applications we must continuously gather information to provide a good estimate of the state of the environment at every point in time. A robot may tour an environ...
Alexandra Meliou, Andreas Krause, Carlos Guestrin,...
VL
1997
IEEE
165views Visual Languages» more  VL 1997»
15 years 7 months ago
Alterable Visual Languages
The large number of programming languages in the world is a consequence of the broad spectrum of human preferences for different notational styles and semantic models, which depen...
Chris M. Holt
FSTTCS
2009
Springer
15 years 9 months ago
Donation Center Location Problem
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
Chien-Chung Huang, Zoya Svitkina
PASTE
2010
ACM
15 years 8 months ago
Extracting compiler provenance from program binaries
We present a novel technique that identifies the source compiler of program binaries, an important element of program provenance. Program provenance answers fundamental questions...
Nathan E. Rosenblum, Barton P. Miller, Xiaojin Zhu