Sciweavers

3914 search results - page 591 / 783
» Automating SLA modeling
Sort
View
CSL
2009
Springer
15 years 10 months ago
Tree-Width for First Order Formulae
We introduce tree-width for first order formulae , fotw(). We show that computing fotw is fixed-parameter tractable with parameter fotw. Moreover, we show that on classes of formul...
Isolde Adler, Mark Weyer
GIS
2007
ACM
15 years 10 months ago
Randomization in traffic information sharing systems
In this paper, we consider a traffic information sharing system based on Floating Car Data (FCD). FCD is one of the methods used to gather traffic information; it uses vehicles as...
Masaaki Tanizaki, Ouri Wolfson
LICS
1991
IEEE
15 years 9 months ago
Logic Programming in a Fragment of Intuitionistic Linear Logic
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
Joshua S. Hodas, Dale Miller
CSL
2010
Springer
15 years 7 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
BMCBI
2007
157views more  BMCBI 2007»
15 years 6 months ago
Impact of image segmentation on high-content screening data quality for SK-BR-3 cells
Background: High content screening (HCS) is a powerful method for the exploration of cellular signalling and morphology that is rapidly being adopted in cancer research. HCS uses ...
Andrew A. Hill, Peter LaPan, Yizheng Li, Steve Han...