Sciweavers

1559 search results - page 303 / 312
» Some Group Theory Problems
Sort
View
87
Voted
STACS
2010
Springer
15 years 4 months ago
Branching-time Model Checking of One-counter Processes
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...
Stefan Göller, Markus Lohrey
WSDM
2009
ACM
104views Data Mining» more  WSDM 2009»
15 years 4 months ago
Top-k aggregation using intersections of ranked inputs
There has been considerable past work on efficiently computing top k objects by aggregating information from multiple ranked lists of these objects. An important instance of this...
Ravi Kumar, Kunal Punera, Torsten Suel, Sergei Vas...
AIIA
2007
Springer
15 years 3 months ago
Towards Automated Game Design
Abstract. Game generation systems perform automated, intelligent design of games (i.e. videogames, boardgames), reasoning about both the rule system of the game and the visual real...
Mark J. Nelson, Michael Mateas
CLEF
2007
Springer
15 years 3 months ago
Multiplying Concept Sources for Graph Modeling
This paper presents the LIG contribution to the CLEF 2007 medical retrieval task (i.e. ImageCLEFmed). The main idea in this paper is to incorporate medical knowledge in the langua...
Loïc Maisonnasse, Éric Gaussier, Jean-...
ATAL
2005
Springer
15 years 3 months ago
Optimal status sets of heterogeneous agent programs
There are many situations where an agent can perform one of several sets of actions in responses to changes in its environment, and the agent chooses to perform the set of actions...
Bogdan Stroe, V. S. Subrahmanian, Sudeshna Dasgupt...