Sciweavers

635 search results - page 35 / 127
» Some Computational Problems Related to Pseudo-intents
Sort
View
SPLST
2003
14 years 11 months ago
How to Draw a Sequence Diagram
Abstract. In this paper, we consider the aesthetic criteria and constraints related to the layouts of UML sequence diagrams. We consider the applicability of the traditional graph ...
Timo Poranen, Erkki Mäkinen, Jyrki Nummenmaa
AI
2006
Springer
14 years 9 months ago
Solving logic program conflict through strong and weak forgettings
We consider how to forget a set of atoms in a logic program. Intuitively, when a set of atoms is forgotten from a logic program, all atoms in the set should be eliminated from thi...
Yan Zhang, Norman Y. Foo
FUIN
2010
93views more  FUIN 2010»
14 years 8 months ago
SAT as a Programming Environment for Linear Algebra
In this paper we present an application of the propositional SATisfiability environment to computing some simple orthogonal matrices and some interesting tasks in the area of cry...
Marian Srebrny, Lidia Stepien
SIAMCO
2008
56views more  SIAMCO 2008»
14 years 9 months ago
Singular Trajectories of Control-Affine Systems
Abstract. When applying methods of optimal control to motion planning or stabilization problems, some theoretical or numerical difficulties may arise, due to the presence of specif...
Yacine Chitour, Frédéric Jean, Emman...
IPPS
2003
IEEE
15 years 2 months ago
Mesh Partitioning: A Multilevel Ant-Colony-Optimization Algorithm
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
Peter Korosec, Jurij Silc, Borut Robic