615 search results - page 11 / 123 » Completeness of Combinations of Constructor Systems |
ICECCS
1995
IEEE
13 years 11 months ago
1995
IEEE
Large and complex software systems contain a variety of entities objects and a complex control system transformationfunction . The pure object-orienteddesign and structured des...
JAIR
2007
13 years 7 months ago
2007
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
CC
2005
Springer
14 years 29 days ago
2005
Springer
We introduce a new approach, called completeness analysis, to computing points-to sets for incomplete Java programs such as library modules or applications in the presence of dynam...
WADT
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. Narrowing is a method for solving equations in the equational theories of term rewriting systems. Unification and rewriting, the central operations in narrowing, are ofte...
ICRA
2002
IEEE
14 years 13 days ago
2002
IEEE
Trajectory design for high-dimensional systems with nonconvex constraints is a challenging problem considered in this paper. Classical dynamic programming is often employed, but c...