Sciweavers

340 search results - page 12 / 68
» ets 2009
Sort
View
98
Voted
CSR
2009
Springer
14 years 11 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
ECSQARU
2009
Springer
14 years 8 months ago
Soft Constraints Processing over Divisible Residuated Lattices
We claim that divisible residuated lattices (DRLs) can act as a unifying evaluation framework for soft constraint satisfaction problems (soft CSPs). DRLs form the algebraic semanti...
Simone Bova
VRST
2009
ACM
15 years 2 months ago
Crime scene robot and sensor simulation
Virtual reality has been proposed as a training regime for a large number of tasks from surgery rehearsal (cf. [Robb et al. 1996], to combat simulation (cf. [U. S. Congress, Offi...
Robert Codd-Downey, Michael Jenkin
85
Voted
ACL
2010
14 years 8 months ago
Bootstrapping Semantic Analyzers from Non-Contradictory Texts
We argue that groups of unannotated texts with overlapping and non-contradictory semantics represent a valuable source of information for learning semantic representations. A simp...
Ivan Titov, Mikhail Kozhevnikov
JMLR
2010
128views more  JMLR 2010»
14 years 5 months ago
Optimal Allocation Strategies for the Dark Pool Problem
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuousvalued allocations are allowed. We also propose a...
Alekh Agarwal, Peter L. Bartlett, Max Dama