|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6530 occurrences of 3325 keywords
|
|
|
Results
Found 12252 publication records. Showing 12252 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
94 | Lei Chi, Clyde W. Holsapple, Cidambi Srinivasan |
The linkage between IOS use and competitive action: a competitive dynamics perspective. |
Inf. Syst. E Bus. Manag. |
2007 |
DBLP DOI BibTeX RDF |
IOS use, Competitive action, Competitive dynamics, IT measures |
65 | Koji M. Kobayashi, Shuichi Miyazaki, Yasuo Okabe |
Competitive buffer management for multi-queue switches in qos networks using packet buffering algorithms. |
SPAA |
2009 |
DBLP DOI BibTeX RDF |
multi-queue switches, competitive analysis, buffer management |
53 | Ran El-Yaniv, Ron Kaniel, Nathan Linial |
Competitive Optimal On-Line Leasing. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Lease-or-buy problem, Equipment rental, Ski rental, Competitive analysis, On-line algorithms, Leasing |
52 | Amos Fiat, Manor Mendel |
Truly Online Paging with Locality of Reference. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
online paging, access graph model, strongly competitive paging algorithm, access sequence, competitive deterministic algorithm, competitive randomized algorithm, page slots, virtual address space, virtual translation tables, probabilistic data structures, extended access graph, memory, locality of reference, paged storage |
50 | Ryotaro Kamimura |
Controlled Competitive Learning: Extending Competitive Learning to Supervised Learning. |
IJCNN |
2007 |
DBLP DOI BibTeX RDF |
|
50 | Ryotaro Kamimura |
Competitive Learning by Information Maximization: Eliminating Dead Neurons in Competitive Learning. |
ICANN |
2003 |
DBLP DOI BibTeX RDF |
winner-take-all, dead neurons, competitive learning, Mutual information maximization |
45 | Ryotaro Kamimura, Fumihiko Yoshida, Ryozo Kitajima |
Collective Information-Theoretic Competitive Learning: Emergency of Improved Performance by Collectively Treated Neurons. |
ICONIP (1) |
2006 |
DBLP DOI BibTeX RDF |
collective distance, generalization, competition, mutual information maximization |
45 | Ruey-Maw Chen, Shih-Tang Lo, Yueh-Min Huang |
Solving Multiprocessor Real-Time System Scheduling with Enhanced Competitive Scheme. |
ICONIP (2) |
2006 |
DBLP DOI BibTeX RDF |
Slack neuron, Scheduling, Hopfield neural network, Competitive learning |
45 | Leonidas Palios |
A New Competitive Strategy for Reaching the Kernel of an Unknown Polygon. |
SWAT |
2000 |
DBLP DOI BibTeX RDF |
curve with increasing chords, kernel, Motion planning, simple polygon, competitive algorithm |
45 | Roberto Daniele, Andrew J. Frew |
Using Concept Maps to Examine Business Models and Drivers of Competitive Advantage for Travel eMediaries. |
ENTER |
2005 |
DBLP DOI BibTeX RDF |
travel agents, travel eMediaries, business models, competitive advantage, competitive strategy |
45 | Amos Fiat, Yishay Mansour, Adi Rosén, Orli Waarts |
Competitive Access Time via Dynamic Storage Rearrangement (Preliminary Version). |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
competitive access time, dynamic storage rearrangement, industrial stacker crane warehouse, automatic robot run warehouse, disk track optimization, two dimensional memory management, bubble memory, doubly linked list management, computational complexity, database, graph theory, lower bounds, optimisation, database management systems, upper bounds, server, storage allocation, probability distribution, tree structure, tree data structures, operations research, undirected graph, process migration, competitive algorithms, competitive algorithms, warehouse, disk storage, mass storage systems |
45 | Yair Bartal, Adi Rosén |
The Distributed k-Server Problem-A Competitive Distributed Translator for k-Server Algorithms |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
poly(k)-competitive distributed algorithms, distributed k-server problem, competitive distributed translator, mobile servers, mobile resources, control messages, computer networks, communication cost, competitive ratios |
44 | Leah Epstein, Asaf Levin |
On the Max Coloring Problem. |
WAOA |
2007 |
DBLP DOI BibTeX RDF |
|
41 | Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator |
O(log log n)-competitive dynamic binary search trees. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
41 | Tobias Harks, Stefan Heinz 0001, Marc E. Pfetsch |
Competitive Online Multicommodity Routing. |
Theory Comput. Syst. |
2009 |
DBLP DOI BibTeX RDF |
Online network optimization, Multicommodity routing, Competitive analysis, Unsplittable flow |
41 | Wing-Kai Hon, Rahul Shah 0001, Peter J. Varman, Jeffrey Scott Vitter |
Tight competitive ratios for parallel disk prefetching and caching. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
parallel disk model, online algorithms, competitive analysis |
41 | Chun-Lin Xin, Wei-Min Ma, Lei Yang |
Competitive Analysis of Two Special Online Device Replacement Problems. |
J. Comput. Sci. Technol. |
2008 |
DBLP DOI BibTeX RDF |
device replacement, online algorithm, competitive analysis, competitive ratio |
40 | Luca Becchetti, Stefano Leonardi 0001, Alberto Marchetti-Spaccamela, Kirk Pruhs |
Semi-clairvoyant Scheduling. |
ESA |
2003 |
DBLP DOI BibTeX RDF |
|
40 | Leah Epstein |
On-Line Variable Sized Covering. |
COCOON |
2001 |
DBLP DOI BibTeX RDF |
|
40 | Ferdinando Cicalese, Eduardo Sany Laber |
A new strategy for querying priced information. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
priced information, competitive analysis, monotone function |
40 | Adi Rosén, Gabriel Scalosub |
Rate vs. buffer size: greedy information gathering on the line. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
competitive network throughput, online algorithms, competitive analysis, buffer management, information gathering |
37 | Danny Kuminov, Moshe Tennenholtz |
Competitive Safety Strategies in Position Auctions. |
WINE |
2007 |
DBLP DOI BibTeX RDF |
|
37 | Meng-Jung Shih, Duen-Ren Liu, Ming-Li Hsu |
Mining Changes in Patent Trends for Competitive Intelligence. |
PAKDD |
2008 |
DBLP DOI BibTeX RDF |
change mining, patent trend, competitive intelligence |
37 | Björn Johansson 0001 |
Developing a "Better" ERP System: The Risk of Loosing Competitive Advantage. |
CONFENIS (2) |
2007 |
DBLP DOI BibTeX RDF |
ERP development, Enterprise resource planning (ERP), Value Chain, Competitive advantage, Resource-based view |
37 | Ruey-Maw Chen, Shih-Tang Lo, Yueh-Min Huang |
Solving Inequality Constraints Job Scheduling Problem by Slack Competitive Neural Scheme. |
IEA/AIE |
2007 |
DBLP DOI BibTeX RDF |
Slack neuron, Competitive Hopfield neural network, Scheduling, Real-time |
37 | Wilson Oh, Poh Wah Khong |
Competitive advantage through pleasurable products. |
DPPI |
2003 |
DBLP DOI BibTeX RDF |
intellectual products, intellectual resources, pleasurable products, competitive advantage, intellectual capital |
37 | Jeff Edmonds, Suprakash Datta, Patrick W. Dymond |
TCP is competitive against a limited adversary. |
SPAA |
2003 |
DBLP DOI BibTeX RDF |
scheduling, performance evaluation, congestion control, TCP/IP, competitive analysis |
37 | Sabah al-Binali |
A Risk-Reward Framework for the Competitive Analysis of Financial Games. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Adaptive trading strategies, Forecast, Competitive analysis, Risk, On-line algorithms, Reward |
37 | Xiaotie Deng, Elias Koutsoupias, Philip D. MacKenzie |
Competitive Implementation of Parallel Programs. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Scheduling, Parallel computation, Compiler, Competitive analysis, Communication delay |
36 | C. Greg Plaxton, Yu Sun 0012, Mitul Tiwari, Harrick M. Vin |
Online Compression Caching. |
SWAT |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Alexander Fanghänel, Sascha Geulen, Martin Hoefer 0001, Berthold Vöcking |
Online capacity maximization in wireless networks. |
SPAA |
2010 |
DBLP DOI BibTeX RDF |
online algorithms, competitive analysis, physical model, sinr |
36 | Noga Alon, Baruch Awerbuch, Yossi Azar, Niv Buchbinder, Joseph Naor |
A general approach to online network optimization problems. |
ACM Trans. Algorithms |
2006 |
DBLP DOI BibTeX RDF |
Online network optimization, group Steiner, multi-cuts, competitive analysis, facility location, randomized rounding |
36 | Jason D. Hartline, Robert McGrew 0001 |
From optimal limited to unlimited supply auctions. |
EC |
2005 |
DBLP DOI BibTeX RDF |
auctions, mechanism design, competitive analysis |
36 | Noga Alon, Yossi Azar, Shai Gutner |
Admission control to minimize rejections and online set cover with repetitions. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
admission control, competitive, set cover, on-line |
36 | Pirkko Walden, Christer Carlsson |
Hyperknowledge and expert systems: a case study of knowledge formation processes. |
HICSS (3) |
1995 |
DBLP DOI BibTeX RDF |
knowledge formation processes, action programs, sustainable competitive advantages, business units, strategic planning period, Woodstrat, action program activities, business unit levels, competitive elements, intermodular links, user-developed expert knowledge, hyperknowledge user interface, user interfaces, case study, expert systems, expert systems, business data processing, strategic planning, user-supportive, strategic management |
34 | Ernesto Chiarantoni, Giuseppe Acciani, Girolamo Fornarelli, Silvano Vergura |
Robust Unsupervised Competitive Neural Network by Local Competitive Signals. |
ICANN |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Jianfeng Chen, Jianwei Zheng |
The Construction and Analysis of Enterprise External Competitive Advantage Function Based on Knowledge Network in Urban Agglomerations. |
WKDD |
2009 |
DBLP DOI BibTeX RDF |
|
33 | Ho-Leung Chan, Tak Wah Lam, Kin-Shing Liu |
Extra unit-speed machines are almost as powerful as speedy machines for competitive flow time scheduling. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Ryotaro Kamimura, Fumihiko Yoshida |
Automatic Inference of Cabinet Approval Ratings by Information-Theoretic Competitive Learning. |
ICONIP (2) |
2006 |
DBLP DOI BibTeX RDF |
|
33 | Lili Ding, Chunlin Xin, Jian Chen |
A Risk-Reward Competitive Analysis of the Bahncard Problem. |
AAIM |
2005 |
DBLP DOI BibTeX RDF |
|
33 | Grammati E. Pantziou, George P. Pentaris, Paul G. Spirakis |
Competitive Call Control in Mobile Networks. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
33 | Kaustubh Deshmukh, Andrew V. Goldberg, Jason D. Hartline, Anna R. Karlin |
Truthful and Competitive Double Auctions. |
ESA |
2002 |
DBLP DOI BibTeX RDF |
|
33 | John R. Douceur, Roger Wattenhofer |
Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System. |
DISC |
2001 |
DBLP DOI BibTeX RDF |
|
33 | Ryotaro Kamimura |
Enhancing and Relaxing Competitive Units for Feature Discovery. |
Neural Process. Lett. |
2009 |
DBLP DOI BibTeX RDF |
SOM, Mutual information, Feature detection, Competitive learning |
33 | Jiancong Fan, Jiuhong Ruan, Yongquan Liang |
An Evolutionary Solution for Cooperative and Competitive Mobile Agents. |
AICI |
2009 |
DBLP DOI BibTeX RDF |
competitive agents, mobile agent, evolution, cooperative agents |
33 | William Aiello, Alexander Kesselman, Yishay Mansour |
Competitive buffer management for shared-memory switches. |
ACM Trans. Algorithms |
2008 |
DBLP DOI BibTeX RDF |
shared memory, competitive analysis, Buffer management |
33 | Dimitris Fotakis 0001 |
On the Competitive Ratio for Online Facility Location. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
Metric facility location, Online algorithms, Competitive analysis |
33 | Chadi Kari, Alexander Russell, Narasimha K. Shashidhar |
Randomized Work-Competitive Scheduling for Cooperative Computing on k-partite Task Graphs. |
NCA |
2008 |
DBLP DOI BibTeX RDF |
partitionable networks, distributed computing, randomized algorithms, competitive analysis, On-line algorithms |
33 | Tak Wah Lam, Lap-Kei Lee, Isaac Kar-Keung To, Prudence W. H. Wong |
Competitive non-migratory scheduling for flow time and energy. |
SPAA |
2008 |
DBLP DOI BibTeX RDF |
dynamic speed scaling, online scheduling algorithms, competitive analysis, energy minimization |
33 | Chuanpeng Li, Kai Shen, Athanasios E. Papathanasiou |
Competitive prefetching for concurrent sequential I/O. |
EuroSys |
2007 |
DBLP DOI BibTeX RDF |
competitive prefetching, performance evaluation, I/O |
33 | Guojian Cheng, Tianshi Liu, Kuisheng Wang, Jiaxin Han |
Soft Competitive Learning and Growing Self-Organizing Neural Networks for Pattern Classification. |
SYNASC |
2006 |
DBLP DOI BibTeX RDF |
Soft Competitive Learning, Neural Gas Networks, Growing Neural Gas, Kohonen Self-organizing Maps |
33 | Hiroshi Fujiwara, Kazuo Iwama |
Average-Case Competitive Analyses for Ski-Rental Problems. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
Online algorithms, Competitive analysis |
33 | Ryotaro Kamimura, Sachiko Aida-Hyugaji |
Maximizing the Ratio of Information to Its Cost in Information Theoretic Competitive Learning. |
ICANN (2) |
2005 |
DBLP DOI BibTeX RDF |
winner-take-all, ratio, generalization, supervised learning, cost, competitive learning, Gaussian, mutual information maximization |
33 | Yeo Keun Kim, Jae Yun Kim, Yeongho Kim |
A Tournament-Based Competitive Coevolutionary Algorithm. |
Appl. Intell. |
2004 |
DBLP DOI BibTeX RDF |
competitive coevolutionary algorithm, entry fee exchange, tournament competition, localized elitism, sorting network |
33 | Yigal Bejerano, Israel Cidon, Joseph Naor |
Efficient handoff rerouting algorithms: a competitive on-line algorithmic approach. |
IEEE/ACM Trans. Netw. |
2002 |
DBLP DOI BibTeX RDF |
handoff rerouting algorithms, personal communication systems (PCS), online algorithms, competitive analysis, connection management |
33 | Ran Bachrach, Ran El-Yaniv, M. Reinstadtler |
On the Competitive Theory and Practice of Online List Accessing Algorithms. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
List accessing, List update, Self-organizing data structures, Calgary Corpus, Online algorithms, Competitive analysis, Lossless compression |
33 | Hichem Frigui, Raghu Krishnapuram |
A Robust Competitive Clustering Algorithm With Applications in Computer Vision. |
IEEE Trans. Pattern Anal. Mach. Intell. |
1999 |
DBLP DOI BibTeX RDF |
competitive clustering, optimal number of clusters, motion estimation, fuzzy clustering, linear regression, robust statistics, range image segmentation, Robust clustering |
33 | Christian Icking, Rolf Klein, Elmar Langetepe |
An Optimal Competitive Strategy for Walking in Streets. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
LR-visibility, on-line navigation, street, Computational geometry, path planning, polygon, autonomous robot, competitive strategy |
33 | Amos Fiat, Yuval Rabani, Yiftach Ravid |
Competitive k-Server Algorithms (Extended Abstract) |
FOCS |
1990 |
DBLP DOI BibTeX RDF |
k-taxicab, competitive k-server algorithms, three-server randomized competitive algorithm, nonconstructive proof, natural generalization, metric spaces |
32 | Yevgeniy Dodis, Shai Halevi |
Incremental Codes. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
32 | David Scot Taylor |
Online Distributed Object Migration. |
WAOA |
2006 |
DBLP DOI BibTeX RDF |
Distributed Algorithms, Object Oriented Programming, Online Algorithms, Data Management, Competitive Analysis |
32 | Nir Andelman |
Randomized queue management for DiffServ. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
randomized algorithms, online algorithms, competitive analysis, active queue management |
32 | Susanne Albers, Markus Schmidt 0003 |
On the performance of greedy algorithms in packet buffering. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
network switch, throughput, competitive, buffer, online, packet, greedy |
32 | Dan Guez, Alexander Kesselman, Adi Rosén |
Packet-mode policies for input-queued switches. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
packet-mode scheduling, competitive analysis, input-queued switches |
32 | David P. Bunde, Yishay Mansour |
Improved combination of online algorithms for acceptance and rejection. |
SPAA |
2004 |
DBLP DOI BibTeX RDF |
QoS, admission control, competitive, on-line |
32 | Marek Chrobak, John Noga |
LRU Is Better than FIFO. |
Algorithmica |
1999 |
DBLP DOI BibTeX RDF |
Caching, Competitive analysis, Paging, On-line algorithms |
32 | S. Muthukrishnan 0001, Rajmohan Rajaraman, Anthony Shaheen, Johannes Gehrke |
Online Scheduling to Minimize Average Stretch. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
scheduling, multiprocessors, online algorithms, competitive analysis |
32 | Bala Kalyanasundaram, Kirk Pruhs |
Minimizing Flow Time Nonclairvoyantly. |
FOCS |
1997 |
DBLP DOI BibTeX RDF |
flow time minimization, dynamically arriving jobs, unknown execution times, average response/flow time, classic CPU scheduling problem, time sharing operating systems, standard 3-field scheduling notation, nonclairvoyant version, randomized nonclairvoyant algorithm, RMLF, multi level feedback algorithm, deterministic nonclairvoyant algorithm, scheduling, minimisation, competitive ratio, Unix operating system, adaptive adversary |
32 | Feifeng Zheng, Yinfeng Xu, E. Zhang 0001 |
On-line production order scheduling with preemption penalties. |
J. Comb. Optim. |
2007 |
DBLP DOI BibTeX RDF |
Preemption penalty, Competitive ratio, On-line scheduling, Competitive strategy |
30 | Allan Borodin |
Can competitive analysis be made competitive? |
CASCON |
1992 |
DBLP BibTeX RDF |
|
29 | Mark Redford, Joseph Sawicki, Prasad Subramaniam, Cliff Hou, Yervant Zorian, Kimon Michaels |
DFM: don't care or competitive weapon? |
DAC |
2009 |
DBLP DOI BibTeX RDF |
RDR, physical verification, sign-off, yield, DFM, design-for-manufacturing, design rules, manufacturing variability, DRC |
29 | Shahar Sarid, Amir Shapiro |
Classifying the multi robot path finding problem into a quadratic competitive complexity class. |
Ann. Math. Artif. Intell. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 68Q25, 68T40, 11Y16, 93C85, 68Q17, 68Q15, 68W40, 68W15 |
29 | Nikhil Bansal 0001, Niv Buchbinder, Joseph Naor |
Randomized competitive algorithms for generalized caching. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
arbitrary sizes, arbitrary weights, knapsack cover inequalities, primal-dual analysis, caching, online algorithms |
29 | Shahar Sarid, Amir Shapiro, Yoav Gabriely |
MRBUG: A Competitive Multi-Robot Path Finding Algorithm. |
ICRA |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Tse Guan Tan, Hui Keng Lau, Jason Teo |
Cooperative Versus Competitive Coevolution for Pareto Multiobjective Optimization. |
LSMS (1) |
2007 |
DBLP DOI BibTeX RDF |
|
29 | Eyal Gordon, Adi Rosén |
Competitive weighted throughput analysis of greedy protocols on DAGs. |
PODC |
2005 |
DBLP DOI BibTeX RDF |
|
29 | M. Angeles García-Bernal, José Muñoz-Pérez, José Antonio Gómez-Ruiz, I. Ladrón de Guevara-López |
A Competitive Neural Network Based on Dipoles. |
IWANN (1) |
2003 |
DBLP DOI BibTeX RDF |
|
29 | Edith Cohen, Haim Kaplan, Uri Zwick |
Competitive Analysis of the LRFU Paging Algorithm. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Wun-Tat Chan, Tak Wah Lam, Hing-Fung Ting, Prudence W. H. Wong |
Competitive Analysis of On-line Stream Merging Algorithms. |
MFCS |
2002 |
DBLP DOI BibTeX RDF |
|
29 | Andrew V. Goldberg, Jason D. Hartline, Andrew Wright |
Competitive auctions and digital goods. |
SODA |
2001 |
DBLP BibTeX RDF |
|
29 | János Csirik, Csanád Imreh, John Noga, Steven S. Seiden, Gerhard J. Woeginger |
Buying a Constant Competitive Ratio for Paging. |
ESA |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Edith Cohen, Haim Kaplan, Uri Zwick |
Competitive Analysis of the LRFU Paging Algorithm. |
WADS |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Avrim Blum, Carl Burch, Adam Kalai |
Finely-Competitive Paging. |
FOCS |
1999 |
DBLP DOI BibTeX RDF |
combining expert advice, machine learning, online algorithms, paging |
29 | Toshiya Itoh, Masafumi Hoshi, Shigeo Tsujii |
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity. |
CRYPTO |
1993 |
DBLP DOI BibTeX RDF |
|
29 | Been-Chian Chien, Rong-Jaye Chen, Wei-Pang Yang |
Competitive Analysis of the On-line Algorithms for Multiple Stacks Sysytems. |
ISAAC |
1992 |
DBLP DOI BibTeX RDF |
|
29 | Yong Long, Jin Peng, Kakuzo Iwamura |
Uncertain equilibrium analysis on profits distribution between partner firms in competitive strategic alliances. |
Soft Comput. |
2009 |
DBLP DOI BibTeX RDF |
Competitive strategic alliances, Profits distribution, Equilibrium under uncertainty, Choquet integral |
29 | Gang Wang 0010, Jian Hu 0001, Yunzhang Zhu, Hua Li 0001, Zheng Chen 0001 |
Competitive analysis from click-through log. |
WWW |
2009 |
DBLP DOI BibTeX RDF |
keyword suggestion, competitive analysis, keyword advertising |
29 | Yiqiao Cai, Jiahai Wang, Jian Yin 0001, Caiwei Li, Yunong Zhang |
Multi-start Stochastic Competitive Hopfield Neural Network for p-Median Problem. |
ISNN (1) |
2009 |
DBLP DOI BibTeX RDF |
competitive Hopfield neural network, stochastic dynamics, multi-start strategy, p-median |
29 | Jivitej S. Chadha, Naveen Garg 0001, Amit Kumar 0001, V. N. Muralidhara |
A competitive algorithm for minimizing weighted flow time on unrelatedmachines with speed augmentation. |
STOC |
2009 |
DBLP DOI BibTeX RDF |
scheduling, approximation algorithms, competitive ratio, flow-time |
29 | Esteban J. Palomo, Enrique Domínguez, Rafael Marcos Luque, José Muñoz |
A Competitive Neural Network for Intrusion Detection Systems. |
MCO |
2008 |
DBLP DOI BibTeX RDF |
data mining, network security, intrusion detection system, Competitive learning |
29 | Jan Nemrava, Tomás Kliegr, Vojtech Svátek, Martin Ralbovský, Jirí Splíchal, Tomás Vejlupek |
Semantic annotation and linking of competitive intelligence reports for business clusters. |
OBI |
2008 |
DBLP DOI BibTeX RDF |
competitive intelligence reports, shared ontology population, ontology engineering, collaborative annotation, document annotation |
29 | Hengyu Wang, Lei Li, Jinwen Ma |
The Competitive EM Algorithm for Gaussian Mixtures with BYY Harmony Criterion. |
ICIC (1) |
2008 |
DBLP DOI BibTeX RDF |
Competitive EM (CEM) algorithm, Model selection, Gaussian mixture, Bayesian Ying-Yang (BYY) harmony learning |
29 | Nicholas S. P. Tay, Robert F. Lusch |
Agent-Based Modeling of Ambidextrous Organizations: Virtualizing Competitive Strategy. |
IEEE Intell. Syst. |
2007 |
DBLP DOI BibTeX RDF |
ambidextrous, genetic algorithms, fuzzy logic, agent-based model, competitive strategy |
29 | Gürkan Öztürk, Zehra Kamisli Ozturk, A. Attila Islier |
A Comparison of Competitive Neural Network with Other AI Techniques in Manufacturing Cell Formation. |
ICNC (1) |
2006 |
DBLP DOI BibTeX RDF |
Cell formation, cellular manufacturing, AI techniques, competitive neural network |
29 | Zhiwu Lu 0001, Xiaoqing Lu |
A Generalized Competitive Learning Algorithm on Gaussian Mixture with Automatic Model Selection. |
RSKT |
2006 |
DBLP DOI BibTeX RDF |
model selection, Gaussian mixture, competitive learning, regularization theory |
29 | Alexander Kesselman, Yishay Mansour, Rob van Stee |
Improved Competitive Guarantees for QoS Buffering. |
Algorithmica |
2005 |
DBLP DOI BibTeX RDF |
QoS Buffering, Competitive analysis |
29 | Yiu-ming Cheung |
On Rival Penalization Controlled Competitive Learning for Clustering with Automatic Cluster Number Selection. |
IEEE Trans. Knowl. Data Eng. |
2005 |
DBLP DOI BibTeX RDF |
Rival Penalization Controlled Competitive Learning, stochastic RPCL, cluster number, clustering |
29 | Amotz Bar-Noy, Yishay Mansour |
Competitive on-line paging strategies for mobile users under delay constraints. |
PODC |
2004 |
DBLP DOI BibTeX RDF |
best experts, mobile computing, competitive analysis, location management |
29 | Marco Celentani, Juan-José Ganuza |
Organized vs. Competitive Corruption. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
competitive and organized corruption, institutional response |
29 | Tammy Drezner, Zvi Drezner |
Validating the Gravity-Based Competitive Location Model Using Inferred Attractiveness. |
Ann. Oper. Res. |
2002 |
DBLP DOI BibTeX RDF |
competitive facility location, choice process, optimization |
Displaying result #1 - #100 of 12252 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|