Sciweavers

1662 search results - page 233 / 333
» The Computational Complexity of Agent Design Problems
Sort
View
ACII
2005
Springer
13 years 10 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
SOCA
2010
IEEE
13 years 6 months ago
Weighted fuzzy clustering for capability-driven service aggregation
Abstract--Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex function...
Christoph Dorn, Schahram Dustdar
ACL
2011
13 years 14 days ago
A Comparison of Loopy Belief Propagation and Dual Decomposition for Integrated CCG Supertagging and Parsing
Via an oracle experiment, we show that the upper bound on accuracy of a CCG parser is significantly lowered when its search space is pruned using a supertagger, though the supert...
Michael Auli, Adam Lopez
IEEEPACT
2006
IEEE
14 years 2 months ago
Branch predictor guided instruction decoding
Fast instruction decoding is a challenge for the design of CISC microprocessors. A well-known solution to overcome this problem is using a trace cache. It stores and fetches alrea...
Oliverio J. Santana, Ayose Falcón, Alex Ram...
ICASSP
2011
IEEE
13 years 17 days ago
User selection schemes for maximizing throughput of multiuser MIMO systems using Zero Forcing Beamforming
The performance of a multiuser MIMO broadcast system depends highly on how the users being served are selected from the pool of users requesting service. Though dirty paper coding...
Anh H. Nguyen, Bhaskar D. Rao