3637 search results - page 68 / 728 » On Dynamic Bit-Probe Complexity |
FAW
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Given a graph G and a nonnegative integer k, the NP-complete Induced Matching problem asks for an edge subset M such that M is a matching and no two edges of M are joined...
ICSEA
2006
IEEE
14 years 3 months ago
2006
IEEE
A modeling process is presented for extracting timingaccurate simulation models from complex embedded realtime systems. The process is supported by two complementary methods for t...
AHS
2007
IEEE
13 years 9 months ago
2007
IEEE
This paper introduces Perplexus, a European project that aims to develop a scalable hardware platform made of custom reconfigurable devices endowed with bio-inspired capabilities...
EOR
2008
13 years 9 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
IJVR
2008
13 years 9 months ago
2008
Based on contemporary Chaos and Complexity Theories, ImaginationTOOLSTM is an innovative Virtual Reality (VR) software architecture which, by means of an agent-based interface, end...