Sciweavers

4103 search results - page 109 / 821
» Some results on the Collatz problem
Sort
View
SIAMDM
2008
77views more  SIAMDM 2008»
15 years 6 months ago
The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
Angel Corberán, Isaac Plana, José M....
TALG
2010
158views more  TALG 2010»
15 years 1 months ago
Clustering for metric and nonmetric distance measures
We study a generalization of the k-median problem with respect to an arbitrary dissimilarity measure D. Given a finite set P of size n, our goal is to find a set C of size k such t...
Marcel R. Ackermann, Johannes Blömer, Christi...
ENTCS
2000
60views more  ENTCS 2000»
15 years 6 months ago
Incompleteness of Behavioral Logics
Incompleteness results for behavioral logics are investigated. We show that there is a basic finite behavioral specification for which the behavioral satisfaction problem is not r...
Samuel R. Buss, Grigore Rosu
ACL
2011
14 years 10 months ago
Identifying Noun Product Features that Imply Opinions
Identifying domain-dependent opinion words is a key problem in opinion mining and has been studied by several researchers. However, existing work has been focused on adjectives an...
Lei Zhang, Bing Liu
CORR
2010
Springer
157views Education» more  CORR 2010»
15 years 4 months ago
Stochastic Budget Optimization in Internet Advertising
Internet advertising is a sophisticated game in which the many advertisers "play" to optimize their return on investment. There are many "targets" for the adve...
Bhaskar DasGupta, S. Muthukrishnan