Sciweavers

1547 search results - page 140 / 310
» Solving Knapsack Problems in a Sticker Based Model
Sort
View
151
Voted
JAR
2006
106views more  JAR 2006»
15 years 3 months ago
Some Computational Aspects of distance-sat
In many AI fields, the problem of finding out a solution which is as close as possible to a given configuration has to be faced. This paper addresses this problem in a propositiona...
Olivier Bailleux, Pierre Marquis
105
Voted
AAAI
2008
15 years 6 months ago
Mathematical Modeling and Convergence Analysis of Trail Formation
An ant deposits pheromone along the path that it travels and is more likely to choose a path with a higher concentration of pheromone. The sensing and dropping of pheromone makes ...
Sameena Shah, Ravi Kothari, Jayadeva, Suresh Chand...
RE
2001
Springer
15 years 8 months ago
XML-Based Method and Tool for Handling Variant Requirements in Domain Models
A domain model describes common and variant requirements for a system family. UML notations used in requirements analysis and software modeling can be extended with “variation p...
Stan Jarzabek, Hongyu Zhang
138
Voted
IJCAI
1989
15 years 4 months ago
Reasoning About Assumptions in Graphs of Models
Solving design and analysis problems in physical worlds requires the representatio n of large amounts of knowledge. Recently, there has been much interest in explicitly making ass...
Sanjaya Addanki, Roberto Cremonini, J. Scott Penbe...
150
Voted
ICCV
2011
IEEE
14 years 3 months ago
A 3D Laplacian-Driven Parametric Deformable Model
3D parametric deformable models have been used to extract volumetric object boundaries and they generate smooth boundary surfaces as results. However, in some segmentation cases, ...
Tian Shen, Xiaolei Huang, Hongsheng Li, Edward Kim...