3604 search results - page 335 / 721 » All Common Subsequences |
184
click to vote
FLAIRS
2006
15 years 8 months ago
2006
There exist a number of algorithms that can solve dynamic constraint satisfaction/optimization problems (DynCSPs or DynCOPs). Because of the large variety in the characteristics o...
177
click to vote
SFP
2001
15 years 8 months ago
2001
: We study type checking that is complete in the sense that it accepts every program whose subexpressions can all be executed without raising a type error at runtime. In a complete...
179
click to vote
AAAI
1998
15 years 8 months ago
1998
qYaditionally, constraint satisfaction problems(CSPs) are characterized using a finite set of constraints expressed within a common,shared constraint language. Whenreasoning acros...
163
click to vote
DOA
2000
15 years 8 months ago
2000
The wide acceptance of object-oriented environments and proposals has renewed interest in all the class inheritance related issues; in particular its implementation in distributed...
174
click to vote
ECIS
2000
15 years 8 months ago
2000
The Internet as a medium for communication and information distribution has opened up new opportunities for distance education programs. Not only is the scope of a program, in ter...