5084 search results - page 677 / 1017 » Proving Possibility Properties |
192
click to vote
WG
2001
Springer
15 years 11 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
177
click to vote
ECRTS
2000
IEEE
15 years 11 months ago
2000
IEEE
The imprecise computation(IC) model is a general scheduling framework, capable of expressing the precision vs. timeliness trade-off involved in many current real-time applications...
181
click to vote
ICCAD
2000
IEEE
15 years 11 months ago
2000
IEEE
–An FPGA switch box is said to be hyper-universal if it is routable for all possible surrounding multi-pin net topologies satisfying the routing resource constraints. It is desir...
177
click to vote
MICRO
2000
IEEE
15 years 11 months ago
2000
IEEE
Register promotion is an optimization that allocates a value to a register for a region of its lifetime where it is provably not aliased. Conventional compiler analysis cannot alw...
135
click to vote
ATAL
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. The agent design problem is as follows: Given an environment, together with a specification of a task, is it possible to construct an agent that will guarantee to succes...