Sciweavers

14518 search results - page 387 / 2904
» Two Problems for Sophistication
Sort
View
ML
2008
ACM
101views Machine Learning» more  ML 2008»
15 years 6 months ago
On reoptimizing multi-class classifiers
Significant changes in the instance distribution or associated cost function of a learning problem require one to reoptimize a previously-learned classifier to work under new cond...
Chris Bourke, Kun Deng, Stephen D. Scott, Robert E...
ICC
2007
IEEE
123views Communications» more  ICC 2007»
16 years 1 months ago
Redundant Coverage in Wireless Sensor Networks
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
Can Fang, Chor Ping Low
ALGORITHMICA
2006
93views more  ALGORITHMICA 2006»
15 years 6 months ago
Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs
For multi-criteria problems and problems with poorly characterized objective, it is often desirable to simultaneously approximate the optimum solution for a large class of objecti...
Ashish Goel, Adam Meyerson
ANOR
2002
93views more  ANOR 2002»
15 years 6 months ago
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions
We use surrogate analysis and constraint pairing in multidimensional knapsack problems to fix some variables to zero and to separate the rest into two groups
Maria A. Osorio, Fred Glover, Peter Hammer
ACSC
2002
IEEE
15 years 11 months ago
Intelligent Agents for Automated One-to-Many e-Commerce Negotiation
Negotiation is a process in which two or more parties with different criteria, constraints, and preferences, jointly reach an agreement on the terms of a transaction. Many current...
Iyad Rahwan, Ryszard Kowalczyk, H. H. Pham