Sciweavers

4126 search results - page 728 / 826
» Set based logic programming
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
13 years 11 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
EOR
2006
148views more  EOR 2006»
13 years 10 months ago
Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection
One of the most important, common and critical management issues lies in determining the "best" project portfolio out of a given set of investment proposals. As this dec...
Karl F. Doerner, Walter J. Gutjahr, Richard F. Har...
IJFCS
2007
98views more  IJFCS 2007»
13 years 10 months ago
Modular Ranking Abstraction
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
Ittai Balaban, Amir Pnueli, Lenore D. Zuck
GLOBECOM
2010
IEEE
13 years 8 months ago
Passively Controllable Smart Antennas
Abstract-- This work deals with devising a secure, powerefficient, beam-steerable and on-chip transmission system for wireless sensor networks. A passively controllable smart (PCS)...
Javad Lavaei, Aydin Babakhani, Ali Hajimiri, John ...
SIGMOD
2012
ACM
224views Database» more  SIGMOD 2012»
12 years 15 days ago
Tiresias: the database oracle for how-to queries
How-To queries answer fundamental data analysis questions of the form: “How should the input change in order to achieve the desired output”. As a Reverse Data Management probl...
Alexandra Meliou, Dan Suciu