Sciweavers

862 search results - page 127 / 173
» Generalized Variational Relation Problems with Applications
Sort
View
CP
2000
Springer
14 years 1 months ago
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
Benjamin W. Wah, Yixin Chen
HICSS
2003
IEEE
85views Biometrics» more  HICSS 2003»
14 years 2 months ago
Revisiting the Firewall Abolition Act
Mobility and the New Global Economy are accompanied by requirements for dynamism and flexibility, with respect to e-commerce, inter-organizational activity, and security. The clas...
Philip Robinson, Jochen Haller
WWW
2010
ACM
14 years 3 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
PODS
2007
ACM
203views Database» more  PODS 2007»
14 years 9 months ago
Decision trees for entity identification: approximation algorithms and hardness results
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...
CORR
2006
Springer
160views Education» more  CORR 2006»
13 years 8 months ago
Frugality ratios and improved truthful mechanisms for vertex cover
In set-system auctions, there are several overlapping teams of agents, and a task that can be completed by any of these teams. The auctioneer's goal is to hire a team and pay...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...