Sciweavers

20197 search results - page 3963 / 4040
» Comparing Computational Power
Sort
View
CSCLP
2008
Springer
13 years 10 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
IMC
2007
ACM
13 years 10 months ago
Quality-of-service class specific traffic matrices in ip/mpls networks
In this paper we consider the problem of determining traffic matrices for end-to-end demands in an IP/MPLS network that supports multiple quality of service (QoS) classes. More pr...
Stefan Schnitter, Franz Hartleb, Martin Horneffer
FPGA
2008
ACM
136views FPGA» more  FPGA 2008»
13 years 10 months ago
HybridOS: runtime support for reconfigurable accelerators
We present HybridOS, a set of operating system extensions for supporting fine-grained reconfigurable accelerators integrated with general-purpose computing platforms. HybridOS spe...
John H. Kelm, Steven S. Lumetta
AAAI
2010
13 years 10 months ago
Recognizing Multi-Agent Activities from GPS Data
Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling si...
Adam Sadilek, Henry A. Kautz
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 10 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
« Prev « First page 3963 / 4040 Last » Next »