Sciweavers

15033 search results - page 2765 / 3007
» Complexity Theory and Algorithms
Sort
View
144
Voted
AIPS
2006
15 years 6 months ago
Planning with Temporally Extended Goals Using Heuristic Search
Temporally extended goals (TEGs) refer to properties that must hold over intermediate and/or final states of a plan. Current planners for TEGs prune the search space during planni...
Jorge A. Baier, Sheila A. McIlraith
DAGSTUHL
2006
15 years 6 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
DBSEC
2006
124views Database» more  DBSEC 2006»
15 years 6 months ago
Consolidating the Access Control of Composite Applications and Workflows
The need for enterprise application integration projects leads to complex composite applications. For the sake of security and efficiency, consolidated access control policies for ...
Martin Wimmer, Alfons Kemper, Maarten Rits, Volkma...
ERSA
2004
106views Hardware» more  ERSA 2004»
15 years 6 months ago
QOS Aware HW/SW Partitioning on Run-time Reconfigurable Multimedia Platforms
Advanced multimedia applications (e.g. based on MPEG-4) will consist of multiple scalable multimedia objects. This scalability enables the application to adapt to different proces...
Nam Pham Ngoc, Gauthier Lafruit, Jean-Yves Mignole...
156
Voted
DLT
2006
15 years 6 months ago
Well-Founded Semantics for Boolean Grammars
Abstract. Boolean grammars [A. Okhotin, Information and Computation 194 (2004) 19-48] are a promising extension of context-free grammars that supports conjunction and negation. In ...
Vassilis Kountouriotis, Christos Nomikos, Panos Ro...
« Prev « First page 2765 / 3007 Last » Next »