Search results for "near-optimal"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
53	Tracy Kimbrel, Anna R. Karlin	Near-Optimal Parallel Prefetching and Caching.	FOCS	1996	DBLP DOI BibTeX RDF	near-optimal parallel prefetching/caching, integrated prefetching/caching, fixed-size cache, backing storage devices, parallel disk case, reverse aggressive algorithm, near-optimal performance, model, algorithms, magnetic disc storage, multiple disks
53	Moni Naor, Leonard J. Schulman, Aravind Srinivasan	Splitters and Near-Optimal Derandomization.	FOCS	1995	DBLP DOI BibTeX RDF	splitters, near-optimal derandomization, fairly general method, k-restrictions, probabilistic bound, near-optimal constructions, fixed-subgraph finding algorithms, deterministic constructions, local-coloring protocol, computational complexity, learning, probability, computational linguistics, hardness of approximation, set cover, derandomization, randomised algorithms, exhaustive testing
43	Richard M. Karp, Elias Koutsoupias, Christos H. Papadimitriou, Scott Shenker	Optimization Problems in Congestion Control.	FOCS	2000	DBLP DOI BibTeX RDF	TCP congestion control algorithm, single unicast flow, near-optimal policies, near-optimal competitive policies, Internet, optimisation, optimization problems, available bandwidth, telecommunication congestion control, Internet congestion control
39	Arun K. Jagota	A near-optimal algorithm for gossiping in a d-dimensional mesh bus interconnection network.	IPPS	1995	DBLP DOI BibTeX RDF	near-optimal algorithm, d-dimensional mesh bus interconnection network, geometric characterization, parallel algorithms, multiprocessor interconnection networks, upper bound, gossiping, message transmission
37	Wolfgang Seibold, Kenneth I. Joy	Near-Optimal Adaptive Polygonization.	Computer Graphics International	1999	DBLP DOI BibTeX RDF	Near-optimal polygon meshes, Quadratic func-tions, Taylor polynomial, Polygo-nalization, Delaunay Triangulation
37	D. P. Elias, Nick G. Kingsbury	The Recovery of a Near Optimal Layer Representation for an Entire Image Sequence.	ICIP (1)	1997	DBLP DOI BibTeX RDF	near optimal layer representation, forward/backward motion estimation, uncovering, maximum likelihood solution, segmentation, image sequence, video coding, occlusion, EM algorithm, image representation, special effects, format conversion
32	Lee-Chin Hsu Liu, David Hung-Chang Du	A Near-Optimal Heuristic Algorithm for Single-Row Routing.	IEEE Trans. Computers	1989	DBLP DOI BibTeX RDF	near-optimal heuristic algorithm, single-flow routing, tighter lower bound, optimality, circuit layout CAD, necessary and sufficient conditions
32	Andrew Chi-Chih Yao	Near-Optimal Time-Space Tradeoff for Element Distinctness	FOCS	1988	DBLP DOI BibTeX RDF	comparison-based branching program, near optimal time-space tradeoff, element distinctness
29	Christos A. Papageorgiou, Panagiotis C. Kokkinos, Emmanouel A. Varvarigos	Optimal and Near-Optimal Energy-Efficient Broadcasting in Wireless Networks.	Euro-Par	2009	DBLP DOI BibTeX RDF
28	Jing-Chiou Liou, Michael A. Palis	A Comparison of General Approaches to Multiprocessor Scheduling.	IPPS	1997	DBLP DOI BibTeX RDF	two phase method, task clustering, near optimal number of processors, task clustering algorithm, cluster merging, communication traffic minimizing, CTM, distributed memory parallel architectures, load balancing, multiprocessing systems, multiprocessor scheduling, task graphs, task graph scheduling
28	En-Hui Yang, Xiang Yu 0001	Rate Distortion Optimization for H.264 Interframe Coding: A General Framework and Algorithms.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
28	Sérgio A. D. Deusdado, Paulo M. M. Carvalho	SimSearch: A New Variant of Dynamic Programming Based on Distance Series for Optimal and Near-Optimal Similarity Discovery in Biological Sequences.	IWPACBB	2008	DBLP DOI BibTeX RDF	Similarity discovery, distance series, dynamic programming
27	Tai-Yi Huang, Yu-Che Tsai, Edward T.-H. Chu	A Near-optimal Solution for the Heterogeneous Multi-processor Single-level Voltage Setup Problem.	IPDPS	2007	DBLP DOI BibTeX RDF
27	Ery Arias-Castro, David L. Donoho, Xiaoming Huo	Near-optimal detection of geometric objects by fast multiscale methods.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
27	William Perrizo, Zhili Zhang, Stephen Krebsbach	Strategies for implementing distributed query algorithms over high-speed, bandwidth-on-demand, wide area networks.	COMPSAC	1997	DBLP DOI BibTeX RDF	high-speed bandwidth-on-demand wide area networks, distributed query processing algorithms, latency delay reduction, multicast issue handling, transmission delay reduction, local processing delay reduction, distributed join algorithm, time cost, near optimal performance, distributed databases, analytical model, distributed database systems
27	Chih-wen Hsueh, Kwei-Jay Lin	An optimal pinwheel scheduler using the single-number reduction technique.	RTSS	1996	DBLP DOI BibTeX RDF	optimal pinwheel scheduler, single-number reduction technique, real-time system scheduling, temporal distances, consecutive task execution, distance constraints, harmonic values, near-optimal heuristic algorithm, simulation, optimality, performance, real-time systems, schedulability condition
27	Jacob Savir	Module level weighted random patterns.	Asian Test Symposium	1995	DBLP DOI BibTeX RDF	module level self-test architecture, pseudorandom pattern generator, universal weighting generator, scan latch, near-optimal weight, signal pins, weight control function, self-test time, logic testing, probability, integrated circuit testing, automatic testing, multivalued logic circuits, boundary scan testing, scan test, weighted random patterns, multiple input signature register
27	Abdelghani Bellaachia, Abdou Youssef	Personalized broadcasting in banyan-hypercube networks.	ICCCN	1995	DBLP DOI BibTeX RDF	personalized broadcasting, banyan-hypercube networks, hypercube based interconnection networks, multiprocessing environment, near optimal personalized broadcasting algorithm, single port communication, multiple port communication, packet switching, hypercube networks, system performance, communication time
27	Thomas M. Conte, Kishore N. Menezes, Sumedh W. Sathaye	A technique to determine power-efficient, high-performance superscalar processors.	HICSS (1)	1995	DBLP DOI BibTeX RDF	high-performance superscalar processors, processor performance advances, thermal power dissipation, architectural power estimates, systematic techniques, user benchmarks, architectural component, real estate usage, superscalar execution units, architectural power measurement, near-optimal search, power-efficient superscalar processors, performance evaluation, parallel architectures, simulated annealing, simulated annealing, parallel machines, power consumption, trace-driven simulation
27	Zhiyong Li 0002, Peter Mills, John H. Reif	Models and resource metrics for parallel and distributed computation.	HICSS (2)	1995	DBLP DOI BibTeX RDF	resource metrics, architectural details, generic parameters, network communication costs, LogP-HMM model, parameterized network model, sequential hierarchical memory model, multilevel memory, local cache, near-optimal sorting, parallel processing, parallel computation, distributed algorithms, distributed computation, resource allocation, sorting, fast Fourier transforms, parallel machines, memory hierarchy, cache storage, design principles, asynchrony, parallel models, input/output, synchronous models, fast Fourier transform algorithms
27	Jair Jehuda, Gilad Koren, Daniel M. Berry	A time-sharing architecture for complex real-time systems.	ICECCS	1995	DBLP DOI BibTeX RDF	time-sharing systems, time-sharing architecture, dynamic multiple job systems, shared-memory multi-processor platforms, multiple states, near-optimal mode selection, reliable real-time time-sharing, job-oriented strategy, best-effort system values, dynamic critical task sets, complex task characteristics, real-time systems, resource allocation, shared memory systems, processor scheduling, portability, dynamic load-balancing, complex real-time systems, divide-and-conquer approach
26	Rina S. Cohen, E. Harry	Automatic Generation of Near-Optimal Translators for Noncircular Attribute Grammars.	POPL	1979	DBLP DOI BibTeX RDF
26	Rohit Sunkam Ramanujam, Bill Lin 0001	Near-optimal oblivious routing on three-dimensional mesh networks.	ICCD	2008	DBLP DOI BibTeX RDF
26	Charles Pandana, K. J. Ray Liu	Near-optimal reinforcement learning framework for energy-aware sensor communications.	IEEE J. Sel. Areas Commun.	2005	DBLP DOI BibTeX RDF
24	Mauro Sozio, Thomas Neumann 0001, Gerhard Weikum	Near-optimal dynamic replication in unstructured peer-to-peer networks.	PODS	2008	DBLP DOI BibTeX RDF	replication, p2p networks
24	Yong Wu, Zhong Chen 0001, Qi Jing, Yongcai Wang	LENO: LEast Rotation Near-Optimal Cluster Head Rotation Strategy in Wireless Sensor Networks.	AINA	2007	DBLP DOI BibTeX RDF
24	Ashwin Sridharan, Roch Guérin, Christophe Diot	Achieving near-optimal traffic engineering solutions for current OSPF/IS-IS networks.	IEEE/ACM Trans. Netw.	2005	DBLP DOI BibTeX RDF	routing, networks, aggregation, traffic engineering
24	Young-Joong Kim, Myo-Taeg Lim	Near-Optimal Fuzzy Systems Using Polar Clustering: Application to Control of Vision-Based Arm-Robot.	KES (4)	2005	DBLP DOI BibTeX RDF
24	Artur Czumaj	An Optimal Parallel Algorithm for Computing a Near-Optimal Order of Matrix Multiplications.	SWAT	1992	DBLP DOI BibTeX RDF
24	Muhammad Farukh Munir, Fethi Filali	Maximizing network-lifetime in large scale heterogeneous wireless sensor-actuator networks: a near-optimal solution.	PE-WASUN	2007	DBLP DOI BibTeX RDF	delay-energy awareness, wireless sensor-actuator networks, optimization, heterogeneity
23	Andreas Koutsopoulos, Sotiris E. Nikoletseas, José D. P. Rolim	Near-optimal data propagation by efficiently advertising obstacle boundaries.	PE-WASUN	2009	DBLP DOI BibTeX RDF	performance evaluation, sensor networks, routing, obstacle avoidance
23	Mitsuru Ishizuka, Yutaka Matsuo	SL Method for Computing a Near-Optimal Solution Using Linear and Non-linear Programming in Cost-Based Hypothetical Reasoning.	PRICAI	1998	DBLP DOI BibTeX RDF
22	Ziyi Chen, Lishan Kang, Lijun Liu	Improved GuoTao Algorithm for Unconstrained Optimization Problems.	ISICA	2008	DBLP DOI BibTeX RDF
22	Karl Bringmann, Tobias Friedrich 0001	The maximum hypervolume set yields near-optimal approximation.	GECCO	2010	DBLP DOI BibTeX RDF	approximation, performance measures, multiobjective optimization, hypervolume indicator
22	Karl Iagnemma, Shingo Shimoda, Zvi Shiller	Near-optimal navigation of high speed mobile robots on uneven terrain.	IROS	2008	DBLP DOI BibTeX RDF
22	Peter Bro Miltersen, Troels Bjerre Sørensen	A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament.	AAMAS	2007	DBLP DOI BibTeX RDF	game theory, game playing, tournament, poker
21	Vijay Sundararajan, Keshab K. Parhi	Low Power Gate Resizing of Combinational Circuits by Buffer-Redistribution.	ARVLSI	1999	DBLP DOI BibTeX RDF	Gate-resizing, Buffer-redistribution, near-optimal, library-specific, optimal, low-power
21	Tze Chiang Lee, John P. Hayes	A Fault-Tolerant Communication Scheme for Hypercube Computers.	IEEE Trans. Computers	1992	DBLP DOI BibTeX RDF	fault-tolerant communication scheme, near-optimal routing, fault-free nodes, computationally efficient routing algorithm, deadlock-free implementations, parallel architectures, fault tolerant computing, broadcasting, hypercube networks, node failures, hypercube computers
21	Frank Thomson Leighton, Eric J. Schwabe	Efficient Algorithms for Dynamic Allocation of Distributed Memory	FOCS	1991	DBLP DOI BibTeX RDF	local memory resources, online allocation algorithm, near-optimal fashion, service delays, algorithms, parallel system, distributed memory, insertions, deletions, dynamic allocation
21	Petra De Jong, Ad J. van de Goor	Test Pattern Generation for API Faults in RAM.	IEEE Trans. Computers	1988	DBLP DOI BibTeX RDF	API faults, near optimal WRITE sequence, integrated circuit testing, BIST, automatic testing, fault location, test pattern generation, Hamiltonian paths, random-access storage, RAM, integrated memory circuits, pattern-sensitive faults
21	Arian Maleki, Morteza Shahram, Gunnar E. Carlsson	A near optimal coder for image geometry with adaptive partitioning.	ICIP	2008	DBLP DOI BibTeX RDF
21	Seung-Hun Jang, Janghoon Yang, Seungyeon Eom, Dong Ku Kim	A Near Optimal Linear Precoding for Multiuser MIMO Throughput Maximization.	VTC Spring	2008	DBLP DOI BibTeX RDF
21	Ning Wang 0001, Kin-Hon Ho, George Pavlou	Adaptive Multi-topology IGP Based Traffic Engineering with Near-Optimal Network Performance.	Networking	2008	DBLP DOI BibTeX RDF
21	Lufeng Shi, Zhijun Zhao, Jindong Tan	Near optimal two-tier target tracking in sensor networks.	IROS	2007	DBLP DOI BibTeX RDF
21	Grzegorz Malewicz	A Method for Creating Near-Optimal Instances of a Certified Write-All Algorithm (Extended Abstract).	ESA	2003	DBLP DOI BibTeX RDF
21	Siu-Cheung Chau, Ada Wai-Chee Fu	A Gracefully Degradable Declustered RAID Architecture with near Optimal Maximal Read and Write Parallelism.	CLUSTER	2000	DBLP DOI BibTeX RDF	Declustered RAID, Fault-Tolerant, RAID, Disk Arrays
21	Abd-Elhamid M. Taha, Ahmed E. Kamal 0001	Optimal and Near Optimal Web Proxy Placement Algorithms for Networks with Planar Graph Topologies.	ICDCS Workshops	2003	DBLP DOI BibTeX RDF
21	Alberto Caprara, Giuseppe Lancia	Optimal and Near - Optimal Solutions for 3D Structure Comparisons.	3DPVT	2002	DBLP DOI BibTeX RDF
20	Tae-Eung Sung	Near-optimal delay-constrained MLR scheduler for multimedia embedded wireless channels.	IWCMC	2009	DBLP DOI BibTeX RDF	modified-linear-rule (MLR) scheduler, multiuser wireless fading channels, queueing delay and power constraints, quality of service (QoS)
20	Ping Yu 0001, Weiwei Sun 0008, Yongrui Qin, Zhuoyao Zhang, Bole Shi	A Data Partition Based Near Optimal Scheduling Algorithm for Wireless Multi-channel Data Broadcast.	DASFAA	2008	DBLP DOI BibTeX RDF	Wireless mobile environments, data broadcast, data partition, multiple channels, hybrid scheduling
20	Tai-Hsuan Wu, Azadeh Davoodi	PaRS: fast and near-optimal grid-based cell sizing for library-based design.	ICCAD	2008	DBLP DOI BibTeX RDF
20	M. Bozyigit, M. Melhi	Dynamic Load Balancing in Distributed Real-Time Systems (Abstract).	ACM Conference on Computer Science	1990	DBLP DOI BibTeX RDF	distributed realtime system, graph theoretic, linear and nonlinear programming, incremental heuristic refinement algorithm, Load balancing, NP-hard
19	Jadwiga R. Bienkowska, Lihua Yu, Sophia Zarakhovich, Robert G. Rogers, Temple F. Smith	Comprehensive statistical method for protein fold recognition.	RECOMB	2000	DBLP DOI BibTeX RDF
19	Yuanyuan Yang 0001, Jianchao Wang	Near-Optimal All-to-All Broadcast in Multidimensional All-Port Meshes and Tori.	IEEE Trans. Parallel Distributed Syst.	2002	DBLP DOI BibTeX RDF	broadcast tree, routing, Parallel computing, mesh, gossip, collective communication, torus, interprocessor communication, all-to-all communication, all-to-all broadcast
19	Haris Javaid, Sri Parameswaran	A design flow for application specific heterogeneous pipelined multiprocessor systems.	DAC	2009	DBLP DOI BibTeX RDF	design space exploration, integer linear programming, MPSoCs
19	Rebecca Willett, Robert D. Nowak	Multiscale Poisson Intensity and Density Estimation.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	Manuel del Valle, Beatriz Sánchez, Luis Fernando Lago-Fernández, Fernando J. Corbacho	Towards a Methodology to Search for Near-Optimal Representations in Classification Problems.	IWINAC (2)	2005	DBLP DOI BibTeX RDF
19	Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique, Mithuna Thottethodi	Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks.	ISCA	2005	DBLP DOI BibTeX RDF
19	Adar A. Kalir, Subhash C. Sarin	Constructing Near Optimal Schedules for the Flow-Shop Lot Streaming Problem with Sublot-Attached Setups.	J. Comb. Optim.	2003	DBLP DOI BibTeX RDF	lot streaming, optimization, flow-shop
19	Iván Dotú, Pascal Van Hentenryck	A simple hybrid evolutionary algorithm for finding Golomb rulers.	Congress on Evolutionary Computation	2005	DBLP DOI BibTeX RDF
19	Arne Andersson, Tony W. Lai	Fast Updating of Well-Balanced Trees.	SWAT	1990	DBLP DOI BibTeX RDF
18	Giuseppe Lancia, Robert D. Carr, Brian Walenz, Sorin Istrail	101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem.	RECOMB	2001	DBLP DOI BibTeX RDF
18	Ran Libeskind-Hadas, Jeffrey R. K. Hartline	Efficient Multicast in Heterogeneous Networks of Workstations.	ICPP Workshops	2000	DBLP DOI BibTeX RDF
18	Aziz Fellah	All-Three: Near-optimal and domain-independent algorithms for near-duplicate detection.	Array	2021	DBLP DOI BibTeX RDF
18	Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun	Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms.	CoRR	2014	DBLP BibTeX RDF
18	Mokhtar Hafayed, Syed Abbas	On Near-Optimal Mean-Field Stochastic Singular Controls: Necessary and Sufficient Conditions for Near-Optimality.	J. Optim. Theory Appl.	2014	DBLP DOI BibTeX RDF
18	Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, Xiaorui Sun	Near-Optimal Density Estimation in Near-Linear Time Using Variable-Width Histograms.	NIPS	2014	DBLP BibTeX RDF
18	Jason D. Hartline, Vladlen Koltun	Near-Optimal Pricing in Near-Linear Time.	WADS	2005	DBLP DOI BibTeX RDF
17	Prosenjit Bose, Karim Douïeb	Efficient Construction of Near-Optimal Binary and Multiway Search Trees.	WADS	2009	DBLP DOI BibTeX RDF
17	Yugang Jia, Christophe Andrieu, Robert J. Piechocki, Magnus Sandell	Depth-First and Breadth-First Search Based Multilevel SGA Algorithms for Near Optimal Symbol Detection in MIMO Systems.	IEEE Trans. Wirel. Commun.	2008	DBLP DOI BibTeX RDF
17	Zhendong Luo, Ming Zhao 0003, Siyang Liu 0001, Yuanan Liu	Generalized Parallel Interference Cancellation With Near-Optimal Detection Performance.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
17	Hiroaki Mukaidani, Hua Xu 0002	Stochastic Pareto near-optimal strategy for weakly-coupled large-scale systems with imperfect local state measurements.	CDC	2008	DBLP DOI BibTeX RDF
17	Sarah Filippi, Olivier Cappé, Fabrice Clérot, Eric Moulines	A Near Optimal Policy for Channel Allocation in Cognitive Radio.	EWRL	2008	DBLP DOI BibTeX RDF
17	Haifeng Yu, Phillip B. Gibbons, Michael Kaminsky, Feng Xiao	SybilLimit: A Near-Optimal Social Network Defense against Sybil Attacks.	SP	2008	DBLP DOI BibTeX RDF	sybil identity, SybilLimit, social networks, Sybil attack
17	Pradeep Aggarwal, Narayan Prasad, Xiaodong Wang 0001	An Enhanced Deterministic Sequential Monte Carlo Method for Near-Optimal MIMO Demodulation With QAM Constellations.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
17	Moses Charikar, Konstantin Makarychev, Yury Makarychev	Near-optimal algorithms for unique games.	STOC	2006	DBLP DOI BibTeX RDF	unique games, approximation algorithms, semidefinite programming, constraint satisfaction problems
17	Stefano De Marchi, Robert Schaback, Holger Wendland	Near-optimal data-independent point locations for radial basis function interpolation.	Adv. Comput. Math.	2005	DBLP DOI BibTeX RDF	radial basis function interpolation, optimal points, greedy algorithms
17	Baihua Zheng, Xia Wu, Xing Jin, Dik Lun Lee	TOSA: a near-optimal scheduling algorithm for multi-channel data broadcast.	Mobile Data Management	2005	DBLP DOI BibTeX RDF	scheduling, mobile computing, multiple channels, wireless broadcast
17	Chung-Min Chen, Christine T. Cheng	From discrepancy to declustering: Near-optimal multidimensional declustering strategies for range queries.	J. ACM	2004	DBLP DOI BibTeX RDF	Declustering schemes, disk allocations, range query, parallel database
17	Pankaj Gupta 0002, Balaji Prabhakar, Stephen P. Boyd	Near-optimal depth-constrained codes.	IEEE Trans. Inf. Theory	2004	DBLP DOI BibTeX RDF
17	Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Roger Wattenhofer	Near-Optimal Hot-Potato Routing on Trees.	Euro-Par	2004	DBLP DOI BibTeX RDF
17	Amit Chakrabarti, Subhash Khot, Xiaodong Sun	Near-Optimal Lower Bounds on the Multi-Party Communication Complexity of Set Disjointness.	CCC	2003	DBLP DOI BibTeX RDF
17	Adnan Aziz, Amit Prakash, Vijaya Ramachandran	A near optimal scheduler for switch-memory-switch routers.	SPAA	2003	DBLP DOI BibTeX RDF	schedulers, parallelism, matching, randomization, routers
17	Changjiang Yang, Ramani Duraiswami, Larry S. Davis	Near-Optimal Regularization Parameters for Applications in Computer Vision.	ICPR (2)	2002	DBLP DOI BibTeX RDF
17	Chung-Min Chen, Christine T. Cheng	From Discrepancy to Declustering: Near optimal multidimensional declustering strategies for range queries. (PDF / PS)	PODS	2002	DBLP DOI BibTeX RDF	declustering schemes, disk allocations, range query, parallel database
17	Carlos Domingo	Faster Near-Optimal Reinforcement Learning: Adding Adaptiveness to the E3 Algorithm.	ALT	1999	DBLP DOI BibTeX RDF
17	Chantal Korostensky, Gaston H. Gonnet	Near Optimal Multiple Sequence Alignments Using a Traveling Salesman Problem Approach.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF
17	Bruce F. Cockburn, Janusz A. Brzozowski	Near-optimal tests for classes of write-triggered coupling faults in RAMs.	J. Electron. Test.	1992	DBLP DOI BibTeX RDF	toggling faults, lower bounds, coupling faults, RAM testing, optimal tests
17	K. C. K. Luo, Yuan-Chieh Chow, Richard E. Newman-Wolfe	Near-optimal heuristics for schedulings on task-dependent machines.	SPDP	1990	DBLP DOI BibTeX RDF
17	Jure Leskovec, Andreas Krause 0001, Carlos Guestrin, Christos Faloutsos, Jeanne M. VanBriesen, Natalie S. Glance	Cost-effective outbreak detection in networks.	KDD	2007	DBLP DOI BibTeX RDF	virus propagation, graphs, sensor placement, submodular functions, information cascades
17	Leyla Kazemi, Cyrus Shahabi, Mehdi Sharifzadeh, Luc Vincent	Optimal traversal planning in road networks with navigational constraints.	GIS	2007	DBLP DOI BibTeX RDF	GIS applications, navigational constraints, traversal planning, road-network
17	Baohua Li, Jennie Si	Approximate Robust Policy Iteration for Discounted Infinite-Horizon Markov Decision Processes with Uncertain Stationary Parametric Transition Matrices.	IJCNN	2007	DBLP DOI BibTeX RDF
17	Liang Guo 0016, Ibrahim Matta	Search Space Reduction in QoS Routing.	ICDCS	1999	DBLP DOI BibTeX RDF	constrained path optimization, simulation, QoS routing
17	Christos A. Papageorgiou, Panagiotis C. Kokkinos, Emmanouel A. Varvarigos	Energy-efficient multicasting in wireless networks with fixed node transmission power.	IWCMC	2009	DBLP DOI BibTeX RDF	multicost, optimal, wireless networks, multicasting, energy
17	Ashok Patel, Bart Kosko	Optimal noise benefits in Neyman-Pearson signal detection.	ICASSP	2008	DBLP DOI BibTeX RDF
17	James S. Plank, Adam L. Buchsbaum, Rebecca L. Collins, Michael G. Thomason	Small Parity-Check Erasure Codes - Exploration and Observations.	DSN	2005	DBLP DOI BibTeX RDF
17	Alexander I. Barvinok, Tamon Stephen	The Distribution of Values in the Quadratic Assignment Problem.	IPCO	2002	DBLP DOI BibTeX RDF
16	Gautam Thatte, Urbashi Mitra	Sensor Selection and Power Allocation for Distributed Estimation in Sensor Networks: Beyond the Star Topology.	IEEE Trans. Signal Process.	2008	DBLP DOI BibTeX RDF
16	Fred G. Gustavson, Lars Karlsson, Bo Kågström	Distributed SBP Cholesky factorization algorithms with near-optimal scheduling.	ACM Trans. Math. Softw.	2009	DBLP DOI BibTeX RDF	Real symmetric matrices, distributed square block format, packed storage, parallel algorithms, parallel computing, Cholesky factorization, positive definite matrices
16	Iyad A. Kanj, Ljubomir Perkovic, Ge Xia	Local Construction of Near-Optimal Power Spanners for Wireless Ad Hoc Networks.	IEEE Trans. Mob. Comput.	2009	DBLP DOI BibTeX RDF