5832 search results - page 392 / 1167 » Software complexity and maintainability |
192
click to vote
QSHINE
2005
IEEE
16 years 12 days ago
2005
IEEE
An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the n...
196
click to vote
VLDB
2005
ACM
16 years 8 days ago
2005
ACM
Emerging large-scale monitoring applications require continuous tracking of complex dataanalysis queries over collections of physicallydistributed streams. Effective solutions hav...
149
click to vote
ACSC
2004
IEEE
15 years 10 months ago
2004
IEEE
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
167
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
We are interested in contributing to solving effectively a particular type of real-time stochastic resource allocation problem. Firstly, one distinction is that certain tasks may c...
162
click to vote
ANSS
2001
IEEE
15 years 10 months ago
2001
IEEE
In a Web-Based federated simulation system, a group of simulation models residing on different machines attached to the Internet, called federates, collaborate with each other to ...