Sciweavers

3628 search results - page 177 / 726
» The Decision Diffie-Hellman Problem
Sort
View
144
Voted
SODA
2010
ACM
235views Algorithms» more  SODA 2010»
16 years 26 days ago
Algorithmic Lower Bounds for Problems Parameterized by Clique-width
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtano...
109
Voted
KDD
2004
ACM
173views Data Mining» more  KDD 2004»
16 years 3 months ago
A microeconomic data mining problem: customer-oriented catalog segmentation
The microeconomic framework for data mining [7] assumes that an enterprise chooses a decision maximizing the overall utility over all customers where the contribution of a custome...
Martin Ester, Rong Ge, Wen Jin, Zengjian Hu
GECCO
2009
Springer
156views Optimization» more  GECCO 2009»
15 years 10 months ago
Articulating user preferences in many-objective problems by sampling the weighted hypervolume
The hypervolume indicator has become popular in recent years both for performance assessment and to guide the search of evolutionary multiobjective optimizers. Two critical resear...
Anne Auger, Johannes Bader, Dimo Brockhoff, Eckart...
126
Voted
IJLIT
2010
67views more  IJLIT 2010»
15 years 1 months ago
Interoperability-Centric Problems: New Challenges and Legal Solutions
Whereas abandonment of detailed regulation is widely asserted to be the true way along with the fluctuations of the business models and emergence of IP-based services, there are s...
Turgut Ayhan Beydogan
160
Voted
ACMICEC
2006
ACM
142views ECommerce» more  ACMICEC 2006»
15 years 9 months ago
Trusting advice from other buyers in e-marketplaces: the problem of unfair ratings
In electronic marketplaces populated by self-interested agents, buyer agents would benefit by modeling the reputation of seller agents, in order to make effective decisions abou...
Jie Zhang, Robin Cohen