Sciweavers

15792 search results - page 2793 / 3159
» Computational Abstraction Steps
Sort
View
HIPEAC
2010
Springer
15 years 10 months ago
Accelerating XML Query Matching through Custom Stack Generation on FPGAs
Abstract. Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XM...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...
ATAL
2007
Springer
15 years 10 months ago
A swarm based approximated algorithm to the extended generalized assignment problem (E-GAP)
This paper addresses distributed task allocation in complex scenarios modeled using the distributed constraint optimization problem (DCOP) formalism. We propose and evaluate a nov...
Paulo Roberto Ferreira Jr., Felipe S. Boffo, Ana L...
AUTONOMICS
2007
ACM
15 years 10 months ago
Adaptive learning of semantic locations and routes
Abstract. Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices...
Keshu Zhang, Haifeng Li, Kari Torkkola, Mike Gardn...
INCDM
2010
Springer
146views Data Mining» more  INCDM 2010»
15 years 10 months ago
Learning from Humanoid Cartoon Designs
Abstract. Character design is a key ingredient to the success of any comicbook, graphic novel, or animated feature. Artists typically use shape, size and proportion as the first de...
Md. Tanvirul Islam, Kaiser Md. Nahiduzzaman, Why Y...
169
Voted
IPMU
2010
Springer
15 years 10 months ago
Credal Sets Approximation by Lower Probabilities: Application to Credal Networks
Abstract. Credal sets are closed convex sets of probability mass functions. The lower probabilities specified by a credal set for each element of the power set can be used as cons...
Alessandro Antonucci, Fabio Cuzzolin
« Prev « First page 2793 / 3159 Last » Next »