3838 search results - page 366 / 768 » Techniques for Optimization of Net Algorithms |
211
Voted
CAD
2006
Springer
2006
Springer
An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages
15 years 7 months ago
Design and analysis of articulated mechanical structures, commonly referred to as linkages, is an integral part of any CAD/CAM system. The most common approaches formulate the pro...
209
Voted
ICML
2006
IEEE
16 years 8 months ago
2006
IEEE
Inference in Markov Decision Processes has recently received interest as a means to infer goals of an observed action, policy recognition, and also as a tool to compute policies. ...
209
Voted
FSTTCS
2009
Springer
16 years 2 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
220
Voted
SECON
2008
IEEE
16 years 1 months ago
2008
IEEE
—Many sensing systems remotely monitor/measure an environment at several sites, and then report these observations to a central site. We propose and investigate several practical...
175
click to vote
INFOCOM
2006
IEEE
16 years 1 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...