Sciweavers

19174 search results - page 3750 / 3835
» Computer Animation Techniques
Sort
View
ICFP
2007
ACM
15 years 7 months ago
iTasks: executable specifications of interactive work flow systems for the web
In this paper we introduce the iTask system: a set of combinators to specify work flows in a pure functional language at a very high level of abstraction. Work flow systems are au...
Rinus Plasmeijer, Peter Achten, Pieter W. M. Koopm...
ACSAC
2004
IEEE
15 years 7 months ago
Using Predators to Combat Worms and Viruses: A Simulation-Based Study
Large-scale attacks generated by fast-spreading or stealthy malicious mobile code, such as flash worms and e-mail viruses, demand new approaches to patch management and disinfecti...
Ajay K. Gupta 0002, Daniel C. DuVarney
AI50
2006
15 years 7 months ago
Fifty Years of AI: From Symbols to Embodiment - and Back
There are many stories to tell about the first fifty years of AI. One story is about AI as one of the big forces of innovation in information technology. It is now forgotten that i...
Luc Steels
ATAL
2006
Springer
15 years 7 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
COCO
2004
Springer
119views Algorithms» more  COCO 2004»
15 years 7 months ago
Tight Lower Bounds for Certain Parameterized NP-Hard Problems
Based on the framework of parameterized complexity theory, we derive tight lower bounds on the computational complexity for a number of well-known NP-hard problems. We start by pr...
Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Hua...
« Prev « First page 3750 / 3835 Last » Next »