2073 search results - page 405 / 415 » Learning for Dynamic Subsumption |
CGO
2010
IEEE
15 years 2 months ago
2010
IEEE
Feedback-directed optimization (FDO) is effective in improving application runtime performance, but has not been widely adopted due to the tedious dual-compilation model, the dif...
106
click to vote
COOPIS
2002
IEEE
15 years 2 months ago
2002
IEEE
The design of virtual workplaces that can support virtual work processes has traditionally been either ad-hoc, or has been influenced by the top-down approaches, such as ‘virtua...
KDD
2009
ACM
15 years 2 months ago
2009
ACM
Currently, the most significant line of defense against malware is anti-virus products which focus on authenticating valid software from a white list, blocking invalid software f...
180
click to vote
AGENTS
2001
Springer
15 years 2 months ago
2001
Springer
Through adjustable autonomy (AA), an agent can dynamically vary the degree to which it acts autonomously, allowing it to exploit human abilities to improve its performance, but wi...
84
Voted
CCO
2001
Springer
15 years 2 months ago
2001
Springer
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...