Sciweavers

1941 search results - page 357 / 389
» On the Hardness of Approximate Reasoning
Sort
View
ATAL
2000
Springer
15 years 4 months ago
Agent Programming with Declarative Goals
A long and lasting problem in agent research has been to close the gap between agent logics and agent programming frameworks. The main reason for this problem of establishing a li...
Koen V. Hindriks, Frank S. de Boer, Wiebe van der ...
CIKM
1997
Springer
15 years 4 months ago
Analysis and Design of Server Informative WWW-Sites
The access patterns of the users of a web-site are traditionally analyzed in order to facilitate the user access to the site's information. In this study, however, a systemat...
Amir M. Zarkesh, Jafar Adibi, Cyrus Shahabi, Reza ...
ECP
1997
Springer
128views Robotics» more  ECP 1997»
15 years 4 months ago
SINERGY: A Linear Planner Based on Genetic Programming
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
Ion Muslea
CASES
2007
ACM
15 years 3 months ago
Rethinking custom ISE identification: a new processor-agnostic method
The last decade has witnessed the emergence of the Application Specific Instruction-set Processor (ASIP) as a viable platform for embedded systems. Extensible ASIPs allow the user...
Ajay K. Verma, Philip Brisk, Paolo Ienne
CCS
2009
ACM
15 years 3 months ago
On lightweight mobile phone application certification
Users have begun downloading an increasingly large number of mobile phone applications in response to advancements in handsets and wireless networks. The increased number of appli...
William Enck, Machigar Ongtang, Patrick Drew McDan...