Sciweavers

1781 search results - page 207 / 357
» Functional Answer Set Programming
Sort
View
OL
2010
77views more  OL 2010»
15 years 3 days ago
A note on Burer's copositive representation of mixed-binary QPs
In an important paper, Burer [2] recently showed how to reformulate general mixed-binary quadratic optimization problems (QPs) into copositive programs where a linear functional i...
Immanuel M. Bomze, Florian Jarre
ENTCS
2006
113views more  ENTCS 2006»
15 years 1 months ago
Concurrent Java Test Generation as a Search Problem
A Random test generator generates executable tests together with their expected results. In the form of a noise-maker, it seeds the program with conditional scheduling primitives ...
Yaniv Eytani
132
Voted
ERLANG
2007
ACM
15 years 5 months ago
An Erlang framework for autonomous mobile robots
This paper presents an Erlang-based framework, developed by the authors, for the realisation of software systems for autonomous mobile robots. On the basis of the analysis of the ...
Corrado Santoro
113
Voted
EOR
2008
70views more  EOR 2008»
15 years 1 months ago
Robust portfolio selection based on a multi-stage scenario tree
The aim of this paper is to apply the concept of robust optimization introduced by Bel-Tal and Nemirovski to the portfolio selection problems based on multi-stage scenario trees. ...
Ruijun Shen, Shuzhong Zhang
127
Voted
ICALP
2004
Springer
15 years 7 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee