Sciweavers

7106 search results - page 1035 / 1422
» Restricted Complexity, General Complexity
Sort
View
AGENTS
2001
Springer
15 years 11 months ago
It knows what you're going to do: adding anticipation to a Quakebot
The complexity of AI characters in computer games is continually improving; however they still fall short of human players. In this paper we describe an AI bot for the game Quake ...
John E. Laird
COCOON
2001
Springer
15 years 11 months ago
PC-Trees vs. PQ-Trees
A data structure called PC-tree is introduced as a generalization of PQ-trees. PC-trees were originally introduced in a planarity test of Shih and Hsu [7] where they represent par...
Wen-Lian Hsu
CRYPTO
2001
Springer
153views Cryptology» more  CRYPTO 2001»
15 years 11 months ago
Universally Composable Commitments
d Abstract) Ran Canetti and Marc Fischlin Abstract. We propose a new security measure for commitment protocols, called Universally Composable (UC) Commitment. The measure guarantee...
Ran Canetti, Marc Fischlin
207
Voted
EMMCVPR
2001
Springer
15 years 11 months ago
Grouping with Directed Relationships
Abstract. Grouping is a global partitioning process that integrates local cues distributed over the entire image. We identify four types of pairwise relationships, attraction and r...
Stella X. Yu, Jianbo Shi
ICALP
2001
Springer
15 years 11 months ago
On Generating All Minimal Integer Solutions for a Monotone System of Linear Inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that for any monotone system of r linear inequaliti...
Endre Boros, Khaled M. Elbassioni, Vladimir Gurvic...
« Prev « First page 1035 / 1422 Last » Next »