62 search results - page 3 / 13 » A branch-and-bound algorithm for the linear ordering problem... |
SIBGRAPI
2005
IEEE
13 years 11 months ago
2005
IEEE
Graph sub-isomorphism is a very common approach to solving pattern search problems, but this is a NP-complete problem. This way, it is necessary to invest in research of approxima...
IPPS
2005
IEEE
13 years 11 months ago
2005
IEEE
— Program code size is a critical factor in determining the manufacturing cost of many embedded systems, particularly those aimed at the extremely costconscious consumer market. ...
INFOCOM
1999
IEEE
13 years 10 months ago
1999
IEEE
Abstract-The Internet today provides no support for privacy or authentication of multicast packets. However,an increasing number of applications will require secure multicast servi...
IPL
2010
13 years 4 months ago
2010
An alphabetic binary tree formulation applies to problems in which an outcome needs to be determined via alphabetically ordered search prior to the termination of some window of o...
ICML
2003
IEEE
14 years 6 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...