1236 search results - page 118 / 248 » Prefix-Like Complexities and Computability in the Limit |
133
click to vote
ISCAS
2006
IEEE
16 years 11 days ago
2006
IEEE
— Fast QR decomposition RLS (FQRD-RLS) algorithms are well known for their good numerical properties and low computational complexity. The FQRD-RLS algorithms do not provide acce...
174
click to vote
CONEXT
2006
ACM
16 years 9 days ago
2006
ACM
In the context of a reconfigurable transport protocol, this paper introduces two protocol instances based on the composition and specialisation of the TFRC congestion control and...
165
click to vote
ICCAD
2005
IEEE
15 years 12 months ago
2005
IEEE
— Balanced truncation (BT) model order reduction (MOR) is known for its superior accuracy and computable error bounds. Balanced stochastic truncation (BST) is a particular BT pro...
164
click to vote
ICDCS
2005
IEEE
15 years 12 months ago
2005
IEEE
Wireless sensor networks (WSNs) are difficult to program and usually run statically-installed software limiting its flexibility. To address this, we developed Agilla, a new midd...
167
click to vote
WIOPT
2005
IEEE
15 years 12 months ago
2005
IEEE
In our prior work, we presented a highly effective local search based heuristic algorithm called the Largest Expanding Sweep Search (LESS) to solve the minimum energy broadcast (M...