Sciweavers

2231 search results - page 277 / 447
» Alternation as a programming paradigm
Sort
View
CP
2009
Springer
16 years 7 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...
177
Voted
ICFP
2002
ACM
16 years 6 months ago
Packrat parsing: : simple, powerful, lazy, linear time, functional pearl
Packrat parsing is a novel technique for implementing parsers in a lazy functional programming language. A packrat parser provides the power and flexibility of top-down parsing wi...
Bryan Ford
ICDCS
2009
IEEE
16 years 3 months ago
FlashLite: A User-Level Library to Enhance Durability of SSD for P2P File Sharing
Peer-to-peer file sharing is popular, but it generates random write traffic to storage due to the nature of swarming. NAND flash memory based Solid-State Drive (SSD) technology...
Hyojun Kim, Umakishore Ramachandran
SAC
2009
ACM
16 years 1 months ago
Dynamic planning and weaving of dependability concerns for self-adaptive ubiquitous services
Ubiquitous computing and service-oriented computing enable the development of a new trend of applications that can opportunely interact with services discovered in the surrounding...
Romain Rouvoy, Frank Eliassen, Mikaël Beauvoi...
IWOCA
2009
Springer
153views Algorithms» more  IWOCA 2009»
16 years 1 months ago
Feedback Vertex Set on Graphs of Low Cliquewidth
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshel...