Sciweavers

1742 search results - page 70 / 349
» An Applicative Module Calculus
Sort
View
MMB
2010
Springer
194views Communications» more  MMB 2010»
14 years 3 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
AINA
2007
IEEE
14 years 4 months ago
Kernel and Application Integrity Assurance: Ensuring Freedom from Rootkits and Malware in a Computer System
Malware and rootkits are serious security vulnerabilities, and they can be designed to be resistant to anti-viral software, or even totally undetectable. This paper described a hi...
Lifu Wang, Partha Dasgupta
ECAL
2001
Springer
14 years 2 months ago
A Visually-Based Evolvable Control Architecture for Agents in Interactive Entertainment Applications
A visually-based evolvable control architecture for agents in interactive entertainment applications is presented. Agents process images of their local surroundings according to ev...
Andrew Vardy
ICCAD
1994
IEEE
67views Hardware» more  ICCAD 1994»
14 years 2 months ago
The reproducing placement problem with applications
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
Wei-Liang Lin, Majid Sarrafzadeh, Chak-Kuen Wong
DAARC
2007
Springer
132views Algorithms» more  DAARC 2007»
14 years 4 months ago
Anaphora Resolution: To What Extent Does It Help NLP Applications?
Papers discussing anaphora resolution algorithms or systems usually focus on the intrinsic evaluation of the algorithm/system and not on the issue of extrinsic evaluation. In the c...
Ruslan Mitkov, Richard Evans, Constantin Orasan, L...