Sciweavers

1523 search results - page 65 / 305
» Partially ordered secretaries
Sort
View
111
Voted
CEC
2008
IEEE
15 years 2 months ago
Directed trees: A powerful representation for sorting and ordering problems
We present a simple framework for dealing with search spaces consisting of permutations. To demonstrate its usefulness, we build upon it a simple (1 + 1)-evolutionary algorithm fo...
Benjamin Doerr, Edda Happ
AAAI
1993
15 years 1 months ago
Numeric Reasoning with Relative Orders of Magnitude
In [Dague, 1993], a formal system ROM(K) involving four relations has been defined to reason with relative orders of magnitude. In this paper, problems of introducing quantitative...
Philippe Dague
93
Voted
AIL
2000
78views more  AIL 2000»
15 years 13 days ago
Representation of formal dispute with a standing order
Computational dialectics is a relatively new field. It is, among others, concerned with the formal representation of argument and dispute. The goal is to suggest algorithms, proce...
Gerard Vreeswijk
100
Voted
TIP
2010
136views more  TIP 2010»
14 years 11 months ago
Wavelet Steerability and the Higher-Order Riesz Transform
Abstract— Our main goal in this paper is to set the foundations of a general continuous-domain framework for designing steerable, reversible signal transformations (a.k.a. frames...
Michael Unser, Dimitri Van De Ville
AMAI
2007
Springer
15 years 22 days ago
Database querying under changing preferences
We present here a formal foundation for an iterative and incremental approach to constructing and evaluating preference queries. Our main focus is query modification: a query tran...
Jan Chomicki