Sciweavers

1381 search results - page 121 / 277
» Computational Complexity of Constraint Satisfaction
Sort
View
CIG
2005
IEEE
15 years 10 months ago
A Generic Approach for Generating Interesting Interactive Pac-Man Opponents
This paper follows on from our previous work focused on formulating an efficient generic measure of user’s satisfaction (‘interest’) when playing predator/prey games. Viewin...
Georgios N. Yannakakis, John Hallam
FGCS
2008
159views more  FGCS 2008»
15 years 4 months ago
Access control management for ubiquitous computing
The purpose of ubiquitous computing is anywhere and anytime access to information within computing infrastructures that is blended into a background and no longer be reminded. Thi...
Hua Wang, Yanchun Zhang, Jinli Cao
WCC
2005
Springer
130views Cryptology» more  WCC 2005»
15 years 10 months ago
On the Design of Codes for DNA Computing
In this paper, we describe a broad class of problems arising in the context of designing codes for DNA computing. We primarily focus on design considerations pertaining to the phen...
Olgica Milenkovic, Navin Kashyap
SSDBM
2003
IEEE
96views Database» more  SSDBM 2003»
15 years 9 months ago
Space Constrained Selection Problems for Data Warehouses and Pervasive Computing
Space constrained optimization problems arise in a multitude of important applications such as data warehouses and pervasive computing. A typical instance of such problems is to s...
Themistoklis Palpanas, Nick Koudas, Alberto O. Men...
EMMCVPR
2001
Springer
15 years 9 months ago
Estimation of Distribution Algorithms: A New Evolutionary Computation Approach for Graph Matching Problems
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
Endika Bengoetxea, Pedro Larrañaga, Isabell...