5214 search results - page 940 / 1043 » The Online Specialization Problem |
CORR
2004
Springer
13 years 8 months ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
COMPUTER
2002
13 years 8 months ago
2002
ions and concepts that let applications access and share resources and services across distributed, wide area networks, while providing common security semantics, distributed resou...
ISCI
2002
2002
Intelligent learning and control of autonomous robotic agents operating in unstructured environments
13 years 8 months ago
The control of autonomous intelligent robotic agent operating in unstructured changing environments includes many objective difficulties. One major difficulty concerns the charact...
JCT
1998
13 years 8 months ago
1998
Let Q(N) denote the number of partitions of N into distinct parts. If ω(k) := 3k2 +k 2 , then it is well known that Q(N) + ∞X k=1 (−1)k “ Q(N − 2ω(k)) + Q(N − 2ω(−k)...
ORL
1998
13 years 8 months ago
1998
Bipartite network flow problems naturally arise in applications such as selective assembly and preemptive scheduling. This paper presents fast algorithms for these problems that ...