Sciweavers

1450 search results - page 151 / 290
» On the Complexity of Hardness Amplification
Sort
View
CSMR
2008
IEEE
14 years 3 months ago
How Lisp Systems Look Different
Many reverse engineering approaches have been developed to analyze software systems written in different languages like C/C++ or Java. These approaches typically rely on a meta-mo...
Adrian Dozsa, Tudor Gîrba, Radu Marinescu
ICC
2008
IEEE
130views Communications» more  ICC 2008»
14 years 3 months ago
A Polynomial-Time Approximation Algorithm for Weighted Sum-Rate Maximization in UWB Networks
— Scheduling in an ad hoc wireless network suffers from the non-convexity of the cost function, caused by the interference between communication links. In previous optimization t...
Gyouhwan Kim, Qiao Li, Rohit Negi
RTCSA
2008
IEEE
14 years 3 months ago
Maximizing the Fault Tolerance Capability of Fixed Priority Schedules
Real-time systems typically have to satisfy complex requirements, mapped to the task attributes, eventually guaranteed by the underlying scheduler. These systems consist of a mix ...
Radu Dobrin, Hüseyin Aysan, Sasikumar Punnekk...
SISAP
2008
IEEE
175views Data Mining» more  SISAP 2008»
14 years 3 months ago
Anytime K-Nearest Neighbor Search for Database Applications
Many contemporary database applications require similarity-based retrieval of complex objects where the only usable knowledge of its domain is determined by a metric distance func...
Weijia Xu, Daniel P. Miranker, Rui Mao, Smriti R. ...
TASE
2008
IEEE
14 years 3 months ago
Reasoning about Channel Passing in Choreography
Abstract Web services choreography describes global models of service interactions among a set of participants. For an interaction to be executed, the participants taken part in it...
Hongli Yang, Chao Cai, Liyang Peng, Xiangpeng Zhao...