Sciweavers

    3475 search results - page 46 / 695
    » Backbones in Optimization and Approximation
    Sort
    View
    TOSN
    2010
    96views more  TOSN 2010»
    Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks
    13 years 8 months ago
    Everywhere sparse approximately optimal minimum energy data gathering and aggregation in sensor networks
    Download  www.csee.umbc.edu
    Konstantinos Kalpakis
    claim paper
    Read More »
    ASC
    2011
    238views Artificial Intelligence» more  ASC 2011»
    Stochastic approximation driven particle swarm optimization with simultaneous perturbation - Who will guide the guide?
    13 years 5 months ago
    Stochastic approximation driven particle swarm optimization with simultaneous perturbation - Who will guide the guide?
    Download  muvis.cs.tut.fi
    Serkan Kiranyaz, Turker Ince, Moncef Gabbouj
    claim paper
    Read More »
    JC
    2010
    61views more  JC 2010»
    Optimal importance sampling for the approximation of integrals
    13 years 4 months ago
    Optimal importance sampling for the approximation of integrals
    Download  mcqmc.mimuw.edu.pl
    Aicke Hinrichs
    claim paper
    Read More »
    WADS
    2005
    Springer
    111views Algorithms» more  WADS 2005»
    Near-Optimal Pricing in Near-Linear Time
    14 years 3 months ago
    Near-Optimal Pricing in Near-Linear Time
    Download  graphics.stanford.edu
    We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
    Jason D. Hartline, Vladlen Koltun
    claim paper
    Read More »
    MOBIHOC
    2002
    ACM
    197views Computer Networks» more  MOBIHOC 2002»
    Message-optimal connected dominating sets in mobile ad hoc networks
    14 years 9 months ago
    Message-optimal connected dominating sets in mobile ad hoc networks
    Download  web.sau.edu
    A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
    Khaled M. Alzoubi, Peng-Jun Wan, Ophir Frieder
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.