1984 search results - page 27 / 397 » The colourful feasibility problem |
ECRTS
2004
IEEE
14 years 1 months ago
2004
IEEE
The problem of feasibility analysis for asynchronous periodic task sets (i.e. where tasks can have an initial offset) is known to be co-NP-complete in the strong sense. A sufficie...
MVA
2002
13 years 9 months ago
2002
This paper proposes a novel approach to constituting all the feasible ways of folding, based on crease infomation obtained from an image of illustrations of general origami drill ...
IPTPS
2003
Springer
14 years 3 months ago
2003
Springer
This paper discusses the feasibility of peer-to-peer full-text keyword search of the Web. Two classes of keyword search techniques are in use or have been proposed: flooding of q...
AAAI
2006
13 years 11 months ago
2006
This report is an expanded version of a paper in AAAI-2006 proceedings. In this report, we investigate the challenges that must be addressed for the Semantic Web to become a feasi...
INFOCOM
2011
IEEE
13 years 1 months ago
2011
IEEE
—Due to the rapid growth of real-time applications and the ubiquity of IEEE 802.11 MAC as a layer-2 protocol for wireless local area networks (WLANs), it is of increasing interes...