4797 search results - page 41 / 960 » The complexity of partition tasks |
ICMAS
2000
13 years 10 months ago
2000
This paper investigates the computational complexity of a fundamental problem in multi-agent systems: given an environment together with a specification of some task, can we const...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Data-driven web applications are usually structured in three tiers with different programming models at each tier. This division forces developers to manually partition applicatio...
DATE
2006
IEEE
14 years 2 months ago
2006
IEEE
In this paper we present a methodology that is based on SystemC [1] for rapid prototyping to greatly enhance and accelerate the exploration of complex systems to optimize the syst...
INFORMATICASI
1998
13 years 8 months ago
1998
Decision table decomposition is a machine learning approach that decomposes a given decision table into an equivalent hierarchy of decision tables. The approach aims to discover d...
IPPS
2003
IEEE
14 years 2 months ago
2003
IEEE
This paper presents a technique, called loop dissevering, to temporally partitioning any type of loop presented in programming languages. The technique can be used in the presence...