Sciweavers

112 search results - page 20 / 23
» Research on the Sheepdog Problem Using Cellular Automata
Sort
View
IDEAL
2004
Springer
15 years 2 months ago
Prediction of Implicit Protein-Protein Interaction by Optimal Associative Feature Mining
Proteins are known to perform a biological function by interacting with other proteins or compounds. Since protein–protein interaction is intrinsic to most cellular processes, pr...
Jae-Hong Eom, Jeong Ho Chang, Byoung-Tak Zhang
RWEB
2009
Springer
15 years 4 months ago
Description Logics
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
Franz Baader
JAIR
2006
110views more  JAIR 2006»
14 years 9 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long
COMPGEOM
2010
ACM
15 years 2 months ago
Finding shortest non-trivial cycles in directed graphs on surfaces
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
Sergio Cabello, Éric Colin de Verdiè...
ISTCS
1992
Springer
15 years 28 days ago
Concurrent Timestamping Made Simple
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
Rainer Gawlick, Nancy A. Lynch, Nir Shavit