Sciweavers

2503 search results - page 276 / 501
» A study of 3-arc graphs
Sort
View
AIPS
2000
15 years 7 months ago
New Results about LCGP, a Least Committed GraphPlan
Planners from the family of Graphplan (Graphplan, IPP, STAN...) are presently considered as the most efficient ones on numerous planning domains. Their partially ordered plans can...
Michel Cayrol, Pierre Régnier, Vincent Vida...
CORR
2011
Springer
149views Education» more  CORR 2011»
15 years 1 months ago
General Iteration graphs and Boolean automata circuits
This article is set in the eld of regulation networks modeled by discrete dynamical systems. It focuses on Boolean automata networks. In such networks, there are many ways to upd...
Mathilde Noual
TMI
2010
134views more  TMI 2010»
15 years 1 months ago
Mitral Annulus Segmentation From 3D Ultrasound Using Graph Cuts
The shape of the mitral valve annulus is used in diagnostic and modeling applications, yet methods to accurately and reproducibly delineate the annulus are limited. This paper pres...
Robert Schneider, Douglas P. Perrin, Nikolay V. Va...
ARSCOM
2004
175views more  ARSCOM 2004»
15 years 6 months ago
Circular Chromatic Number of Hypergraphs
The concept of circular chromatic number of graphs was introduced by Vince(1988). In this paper we define circular chromatic number of uniform hypergraphs and study their basic pr...
Changiz Eslahchi, Arash Rafiey
ICSM
2006
IEEE
16 years 17 days ago
Software Feature Understanding in an Industrial Setting
Software Engineers frequently need to locate and understand the code that implements a specific user feature of a large system. This paper reports on a study by Motorola Inc. and ...
Michael Jiang, Michael Groble, Sharon Simmons, Den...