Sciweavers

188 search results - page 27 / 38
» A System-Level Synthesis Algorithm with Guaranteed Solution ...
Sort
View
131
Voted
DATAMINE
2006
230views more  DATAMINE 2006»
15 years 12 days ago
Mining top-K frequent itemsets from data streams
Frequent pattern mining on data streams is of interest recently. However, it is not easy for users to determine a proper frequency threshold. It is more reasonable to ask users to ...
Raymond Chi-Wing Wong, Ada Wai-Chee Fu
ATAL
2009
Springer
15 years 7 months ago
Planning with continuous resources for agent teams
Many problems of multiagent planning under uncertainty require distributed reasoning with continuous resources and resource limits. Decentralized Markov Decision Problems (Dec-MDP...
Janusz Marecki, Milind Tambe
ATAL
2003
Springer
15 years 5 months ago
Trade of a problem-solving task
This paper focuses on a task allocation problem, particularly in cases where the task is to find a solution to a search problem or a constraint satisfaction problem. If the searc...
Shigeo Matsubara
GLVLSI
2009
IEEE
126views VLSI» more  GLVLSI 2009»
15 years 4 months ago
An efficient cut enumeration for depth-optimum technology mapping for LUT-based FPGAs
Recent technology mappers for LUT based FPGAs employ cut enumeration. Although many cuts are often needed to nd good network, enumerating all cuts with large size consumes run-tim...
Taiga Takata, Yusuke Matsunaga
DAM
2006
132views more  DAM 2006»
15 years 12 days ago
On the combinatorial structure of chromatic scheduling polytopes
Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplyingwirelessaccesstovoice/datacommunicationnetwork...
Javier Marenco, Annegret Wagler