1399 search results - page 270 / 280 » Verification of Test Suites |
PLDI
2003
ACM
14 years 4 months ago
2003
ACM
Compiler writers have crafted many heuristics over the years to approximately solve NP-hard problems efficiently. Finding a heuristic that performs well on a broad range of applic...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
Modular development of concurrent applications requires threadsafe components that behave correctly when called concurrently by multiple client threads. This paper focuses on line...
INFOCOM
2002
IEEE
14 years 3 months ago
2002
IEEE
— For wireless cellular and ad hoc networks with QoS constraints, we propose a suite of problem formulations that allocate network resources to optimize SIR, maximize throughput ...
WECWIS
2002
IEEE
14 years 3 months ago
2002
IEEE
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
AGENTS
2001
Springer
14 years 3 months ago
2001
Springer
Agents are intended to interact in open systems where the knowledge about others (reputation) is incomplete and uncertain. Also, this knowledge about other agents is subjective si...