Sciweavers

4255 search results - page 262 / 851
» Cover
Sort
View
ICTIR
2009
Springer
15 years 4 months ago
An Analysis of NP-Completeness in Novelty and Diversity Ranking
Abstract. A useful ability for search engines is to be able to rank objects with novelty and diversity: the top k documents retrieved should cover possible interpretations of a que...
Ben Carterette
CORR
2010
Springer
72views Education» more  CORR 2010»
15 years 4 months ago
Exploring Simple Triangular and Hexagonal Grid Polygons Online
We examine online grid covering with hexagonal and triangular grids. For arbitrary environments without obstacles we provide a strategy that produces tours of length S C + 1 4 E ...
Daniel Herrmann, Tom Kamphans, Elmar Langetepe
EOR
2010
140views more  EOR 2010»
15 years 4 months ago
Cutting plane algorithms for 0-1 programming based on cardinality cuts
: We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by th...
Osman Oguz
AI
2011
Springer
15 years 1 months ago
Stable models and circumscription
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting point for the development of answer set programmi...
Paolo Ferraris, Joohyung Lee, Vladimir Lifschitz
CDC
2010
IEEE
126views Control Systems» more  CDC 2010»
15 years 1 months ago
An algebraic framework for quadratic invariance
In this paper, we present a general algebraic framework for analysing decentralized control systems. We consider systems defined by linear fractional functions over a commutative ...
Laurent Lessard, Sanjay Lall