1477 search results - page 274 / 296 » Random Convex Programs |
118
Voted
ALGOSENSORS
2007
Springer
15 years 8 months ago
2007
Springer
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
103
Voted
COCOON
2007
Springer
15 years 8 months ago
2007
Springer
We propose new algorithms and improved bounds for interference-aware routing in wireless networks. First, we prove that n arbitrarily matched source-destinations pairs with average...
117
Voted
ISSTA
2004
ACM
15 years 7 months ago
2004
ACM
Evolutionary testing is an effective technique for automatically generating good quality test data. However, for structural testing, the technique degenerates to random testing i...
106
click to vote
NSPW
2003
ACM
15 years 7 months ago
2003
ACM
The ability to analyze and modify binaries is often very useful from a security viewpoint. Security operations one would like to perform on binaries include the ability to extract...
116
click to vote
CP
2003
Springer
15 years 7 months ago
2003
Springer
Constraint satisfaction has been applied with great success in closed-world scenarios, where all options and constraints are known from the beginning and fixed. With the internet,...