Sciweavers

2905 search results - page 455 / 581
» Formal Memetic Algorithms
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
Optimizing cost-sensitive trust-negotiation protocols
Trust negotiation is a process that establishes mutual trust by the exchange of digital credentials and/or guiding policies among entities who may have no pre-existing knowledge a...
Weifeng Chen, L. Clarke, James F. Kurose, Donald F...
IPPS
2005
IEEE
15 years 3 months ago
A Framework for Partitioning Computational Intensive Applications in Hybrid Reconfigurable Platforms
In this paper, we describe a prototype software framework that implements a formalized methodology for partitioning computational intensive applications between reconfigurable har...
Michalis D. Galanis, Athanasios Milidonis, George ...
ISPD
2005
ACM
153views Hardware» more  ISPD 2005»
15 years 3 months ago
Evaluation of placer suboptimality via zero-change netlist transformations
In this paper we introduce the concept of zero-change transformations to quantify the suboptimality of existing placers. Given a netlist and its placement from a placer, we formal...
Andrew B. Kahng, Sherief Reda
KCAP
2005
ACM
15 years 3 months ago
Matching utterances to rich knowledge structures to acquire a model of the speaker's goal
An ultimate goal of AI is to build end-to-end systems that interpret natural language, reason over the resulting logical forms, and perform actions based on that reasoning. This r...
Peter Z. Yeh, Bruce W. Porter, Ken Barker
83
Voted
MOBICOM
2005
ACM
15 years 3 months ago
Effects of routing computations in content-based routing networks with mobile data sources
This paper presents the first quantitative evaluation of the role of routing computations on performance when mobility is introduced to a content-based routing network. Additiona...
Vinod Muthusamy, Milenko Petrovic, Hans-Arno Jacob...