Sciweavers

78 search results - page 5 / 16
» Deciding choreography realizability
Sort
View
ALGORITHMICA
2006
103views more  ALGORITHMICA 2006»
13 years 7 months ago
Recognizing Hole-Free 4-Map Graphs in Cubic Time
We present a cubic-time algorithm for the following problem: Given a simple graph, decide whether it is realized by adjacencies of countries in a map without holes, in which at mo...
Zhi-Zhong Chen, Michelangelo Grigni, Christos H. P...
ICWS
2009
IEEE
14 years 4 months ago
Service Supervision: Coordinating Web Services in Open Environment
ite Web service designed based on abstract Web services, which define only interfaces, allows an application developer to select services required for his application only by set...
Masahiro Tanaka, Toru Ishida, Yohei Murakami, Sato...
JSYML
2010
78views more  JSYML 2010»
13 years 2 months ago
A characterization of the 0-basis homogeneous bounding degrees
We say a countable model A has a 0-basis if the types realized in A are uniformly computable. We say A has a (d-)decidable copy if there exists a model B = A such that the element...
Karen Lange
FASE
2009
Springer
14 years 2 months ago
Controller Synthesis from LSC Requirements
Live Sequence Charts (LSCs) is a visual requirements language for specifying reactive system behavior. When modeling and designing open reactive systems, it is often essential to h...
Hillel Kugler, Cory Plock, Amir Pnueli
ICMCS
2008
IEEE
123views Multimedia» more  ICMCS 2008»
14 years 1 months ago
Scalable data hiding for online textured 3D terrain visualization
A method for 3D scalable visualization, in a client/server environment is presented. The main idea presented in this paper is to increase the quality of 3D visualization for low b...
Khizar Hayat, William Puech, Gilles Gesquiere