Sciweavers

10707 search results - page 1973 / 2142
» Designing executable abstractions
Sort
View
CLEF
2009
Springer
15 years 4 months ago
Unsupervised Morphological Analysis by Formal Analogy
Abstract. While classical approaches to unsupervised morphology acquisition often rely on metrics based on information theory for identifying morphemes, we describe a novel approac...
Jean-François Lavallée, Philippe Lan...
CORR
2009
Springer
106views Education» more  CORR 2009»
15 years 4 months ago
A framework for protein and membrane interactions
dels at different abstraction levels; in particular, higher-level (e.g. membrane) activities can be given a formal biological justification in terms of low-level (i.e., protein) in...
Giorgio Bacci, Davide Grohmann, Marino Miculan
192
Voted
CP
2009
Springer
15 years 4 months ago
Lazy Clause Generation Reengineered
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
Thibaut Feydy, Peter J. Stuckey
DLOG
2009
15 years 4 months ago
A Matter of Principles: Towards the Largest DLP Possible
Abstract. Description Logic Programs (DLP) have been described as a description logic (DL) that is in the "expressive intersection" of DL and datalog. This is a very weak...
Markus Krötzsch, Sebastian Rudolph
ECRTS
2009
IEEE
15 years 4 months ago
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
Abstract--Energy and thermal considerations are increasingly driving system designers to adopt multi-core processors. In this paper, we consider the problem of scheduling periodic ...
Karthik Lakshmanan, Ragunathan Rajkumar, John P. L...
« Prev « First page 1973 / 2142 Last » Next »