2743 search results - page 100 / 549 » Minimization of an M-convex Function |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We introduce several generalizations of classical computer science problems obtained by replacing simpler objective functions with general submodular functions. The new problems i...
COLT
2010
Springer
13 years 7 months ago
2010
Springer
Bandit convex optimization is a special case of online convex optimization with partial information. In this setting, a player attempts to minimize a sequence of adversarially gen...
KIVS
1999
Springer
14 years 1 months ago
1999
Springer
: Location Management of mobile users in a cellular network covers tracking and paging (searching) functionality. In this paper a sequential search strategy is proposed which reduc...
ASPDAC
2009
ACM
14 years 1 months ago
2009
ACM
The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by chargin...
FOAL
2007
ACM
13 years 11 months ago
2007
ACM
We present a preliminary report on typing systems for polyadic µABC, aspect oriented programming—pointcuts and advice—and nothing else. Tuples of uninterpreted names are used...