Sciweavers

6167 search results - page 977 / 1234
» Can Refinement be Automated
Sort
View
SCIA
2007
Springer
154views Image Analysis» more  SCIA 2007»
15 years 7 months ago
3D Deformable Registration for Monitoring Radiotherapy Treatment in Prostate Cancer
Two deformable registration methods, the Demons and the Morphon algorithms, have been used for registration of CT datasets to evaluate their usability in radiotherapy planning for ...
Borja Rodríguez-Vila, Johanna Pettersson, M...
78
Voted
SEKE
2007
Springer
15 years 7 months ago
REM4j - A Framework for Measuring the Reverse Engineering Capability of UML CASE Tools
Reverse Engineering is becoming increasingly important in the software development world today as many organizations are battling to understand and maintain old legacy systems. To...
Steven Kearney, James F. Power
91
Voted
SEMWEB
2007
Springer
15 years 7 months ago
Formulation of Hierarchical Task Network Service (De)composition
The Hierarchical Task Network (HTN) planning method is conceived of as a useful method for Web service composition as well as classical task planning. However, there are no complet...
Seiji Koide, Hideaki Takeda
133
Voted
TARK
2007
Springer
15 years 7 months ago
From conditional probability to the logic of doxastic actions
We investigate the discrete (finite) case of the Popper-Renyi theory of conditional probability, introducing discrete conditional probabilistic models for (multi-agent) knowledge...
Alexandru Baltag, Sonja Smets
TARK
2007
Springer
15 years 7 months ago
The computational complexity of choice sets
Social choice rules are often evaluated and compared by inquiring whether they fulfill certain desirable criteria such as the Condorcet criterion, which states that an alternativ...
Felix Brandt, Felix A. Fischer, Paul Harrenstein