Sciweavers

1968 search results - page 347 / 394
» The Complexity of Valued Constraint Models
Sort
View
EWCBR
2008
Springer
13 years 10 months ago
Situation Assessment for Plan Retrieval in Real-Time Strategy Games
Case-Based Planning (CBP) is an effective technique for solving planning problems that has the potential to reduce the computational complexity of the generative planning approache...
Kinshuk Mishra, Santiago Ontañón, As...
GRAPHICSINTERFACE
2007
13 years 10 months ago
Constrained planar remeshing for architecture
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
Barbara Cutler, Emily Whiting
AAAI
2006
13 years 10 months ago
Tractable Classes of Metric Temporal Problems with Domain Rules
In this paper, we will deal with some important kinds of metric temporal reasoning problems that arise in many real-life situations. In particular, events X0, X1 . . . XN are mode...
T. K. Satish Kumar
BILDMED
2006
120views Algorithms» more  BILDMED 2006»
13 years 10 months ago
Towards Automatic Segmentation of Serial High-Resolution Images
Developing barley grains are to be visualised by a 4-D model, in which spatiotemporal experimental data can be integrated. The most crucial task lies in the automation of the exten...
Cornelia Brüß, Marc Strickert, Udo Seif...
AAAI
1998
13 years 9 months ago
Qualitative Analysis of Distributed Physical Systems with Applications to Control Synthesis
Manyimportant physical phenomena,such as temperature distribution, air flow, and acoustic waves,are describedas continuous,distributed parameterfields. Analyzingandcontrolling the...
Christopher Bailey-Kellogg, Feng Zhao