Sciweavers

341 search results - page 5 / 69
» Decision Complexity in Dynamic Geometry
Sort
View
ATAL
2010
Springer
13 years 9 months ago
Decision making with dynamically arriving information
Decision making is the ability to decide on the best alternative among a set of candidates based on their value. In many real-world domains the value depends on events that occur ...
Meir Kalech, Avi Pfeffer
CAISE
2009
Springer
14 years 2 months ago
Complexity Levels of Representing Dynamics in EA Planning
Abstract. Enterprise Architecture (EA) models provide information on the fundamental as-is structure of a company or governmental agency and thus serve as an informational basis fo...
Stephan Aier, Bettina Gleichauf, Jan Saat, Robert ...
INFOCOM
2003
IEEE
14 years 1 months ago
Network Management Information For Light-Path Assessment: Trade-off between Performance and Complexity
We investigate network management information for light-path assessment to dynamically set up end-to-end lightpaths across administrative domains. Our focus is on invetigating what...
Guanglei Liu, Chuanyi Ji, Vincent W. S. Chan
DGCI
2006
Springer
13 years 11 months ago
Minimal Decomposition of a Digital Surface into Digital Plane Segments Is NP-Hard
This paper deals with the complexity of the decomposition of a digital surface into digital plane segments (DPS for short). We prove that the decision problem (does there exist a ...
Isabelle Sivignon, David Coeurjolly
ALDT
2009
Springer
181views Algorithms» more  ALDT 2009»
14 years 2 months ago
Optimizing the Hurwicz Criterion in Decision Trees with Imprecise Probabilities
This paper is devoted to sequential decision problems with imprecise probabilities. We study the problem of determining an optimal strategy according to the Hurwicz criterion in de...
Gildas Jeantet, Olivier Spanjaard