6514 search results - page 468 / 1303 » Low-Knowledge Algorithm Control |
149
click to vote
DSS
2002
15 years 4 months ago
2002
A thorough understanding of the way in which existing business processes currently practice is essential from the perspectives of both process reengineering and workflow managemen...
154
click to vote
EMSOFT
2010
Springer
15 years 2 months ago
2010
Springer
We propose the first polynomial-time code selection algorithm for minimising the worst-case execution time of a nonnested loop executed on a fully pipelined processor that uses sc...
293
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
146
click to vote
AI
2008
Springer
15 years 4 months ago
2008
Springer
The notion of maintenance often appears in the AI literature in the context of agent behavior and planning. In this paper, we argue that earlier characterizations of the notion of...
121
click to vote
RECSYS
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the course ‘Real Ana...